533 search results - page 5 / 107 » Intensional Models for the Theory of Types |
143
click to vote
LICS
2002
IEEE
15 years 9 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...
160
click to vote
TABLEAUX
2009
Springer
15 years 11 months ago
2009
Springer
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...
143
click to vote
ECOOP
2003
Springer
15 years 9 months ago
2003
Springer
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
165
click to vote
HASKELL
2005
ACM
15 years 10 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
112
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...