Sciweavers

417 search results - page 30 / 84
» Orderings for Innermost Termination
Sort
View
TABLEAUX
2007
Springer
15 years 6 months ago
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
FOSSACS
2003
Springer
15 years 5 months ago
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Andreas Abel, Ralph Matthes, Tarmo Uustalu
VISUALIZATION
2002
IEEE
15 years 4 months ago
A New Object-Order Ray-Casting Algorithm
Many direct volume rendering algorithms have been proposed during the last decade to render 2563 voxels interactively. However a lot of limitations are inherent to all of them, li...
Benjamin Mora, Jean-Pierre Jessel, René Cau...
IEICET
2007
110views more  IEICET 2007»
14 years 11 months ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba
WRLA
2010
14 years 10 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
Francisco Durán, José Meseguer