Sciweavers

727 search results - page 23 / 146
» A Method for Implementing Equational Theories as Logic Progr...
Sort
View
JELIA
2004
Springer
14 years 27 days ago
Combining Decision Procedures for Sorted Theories
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to ...
Cesare Tinelli, Calogero G. Zarba
ICFP
2009
ACM
14 years 8 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
FSTTCS
1999
Springer
13 years 11 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
14 years 1 months ago
Free Modal Algebras: A Coalgebraic Perspective
In this paper we discuss a uniform method for constructing free modal and distributive modal algebras. This method draws on works by (Abramsky 2005) and (Ghilardi 1995). We revisit...
Nick Bezhanishvili, Alexander Kurz