Sciweavers

640 search results - page 73 / 128
» Logical types for untyped languages
Sort
View
ENTCS
2008
92views more  ENTCS 2008»
13 years 9 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
LICS
2002
IEEE
14 years 2 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
ENTCS
2008
105views more  ENTCS 2008»
13 years 9 months ago
Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
Bernd Braßel, Sebastian Fischer, Frank Huch
POPL
2010
ACM
14 years 6 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
JFP
2007
111views more  JFP 2007»
13 years 9 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata