174 search results - page 2 / 35 » Directional Type Checking of Logic Programs |
TLDI
2005
ACM
13 years 11 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
BIRTHDAY
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
POPL
2001
ACM
14 years 5 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...