104 search results - page 17 / 21 » Proving Termination Properties with mu-term |
94
Voted
LICS
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
101
Voted
TPHOL
2008
IEEE
15 years 5 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
94
Voted
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
89
Voted
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
95
Voted
PLILP
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...