Sciweavers

17 search results - page 1 / 4
» Simple Types in Type Theory: Deep and Shallow Encodings
Sort
View
TPHOL
2007
IEEE
13 years 11 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
POPL
2005
ACM
14 years 5 months ago
A simple typed intermediate language for object-oriented languages
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
Juan Chen, David Tarditi
JAR
2008
89views more  JAR 2008»
13 years 4 months ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
COLING
2010
12 years 11 months ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
BIRTHDAY
2010
Springer
13 years 5 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller