Sciweavers

899 search results - page 61 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
137
Voted
ENTCS
2000
120views more  ENTCS 2000»
15 years 3 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
POPL
2012
ACM
13 years 11 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
IFL
2004
Springer
15 years 9 months ago
A Virtual Machine for Functional Logic Computations
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
Sergio Antoy, Michael Hanus, Jimeng Liu, Andrew P....
PPDP
2004
Springer
15 years 9 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
AGP
1997
IEEE
15 years 8 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...