303 search results - page 8 / 61 » Theory Interpretation in Simple Type Theory |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
ENGL
2007
13 years 7 months ago
2007
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...
TPHOL
1997
IEEE
13 years 11 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...