Sciweavers

Share
358 search results - page 1 / 72
» A Type of Partial Recursive Functions
Sort
View
TPHOL
2008
IEEE
9 years 5 months ago
A Type of Partial Recursive Functions
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...
Ana Bove, Venanzio Capretta
TPHOL
2002
IEEE
9 years 4 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
TLCA
2007
Springer
9 years 5 months ago
Computation by Prophecy
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...
Ana Bove, Venanzio Capretta
AML
1998
60views more  AML 1998»
8 years 11 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
CORR
2004
Springer
110views Education» more  CORR 2004»
8 years 11 months ago
On Modal Logics of Partial Recursive Functions
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...
Pavel Naumov
books