34 search results - page 4 / 7 » Partial Recursive Functions in Higher-Order Logic |
104
click to vote
JAR
2010
14 years 4 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
113
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
TPHOL
2008
IEEE
15 years 3 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...
64
Voted
BIRTHDAY
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is ess...
TLCA
2007
Springer
15 years 3 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...