900 search results - page 5 / 180 » Pure Type Systems Formalized |
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
We generalise the notion of pre-logical predicates [HS02] to arbitrary simply typed formal systems and their categorical models. We establish the basic lemma of pre-logical predica...
ICEIS
2003
IEEE
14 years 25 days ago
2003
IEEE
: A definition of types in an information system is given from real-world abstractions through data constructs, schema and definitions to physical data values. Category theory su...
ENTCS
2007
13 years 7 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
JOT
2007
13 years 7 months ago
2007
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. ...