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...
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...
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...
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 ...
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...