Sciweavers

640 search results - page 31 / 128
» Logical types for untyped languages
Sort
View
IMPERIAL
1994
13 years 11 months ago
Geometric logic as a Specification Language
The \observational content" of geometric logic is discussed and it is proposed that geometric logic is an appropriate basis for a Z-like speci cation language in which schema...
Steven Vickers
ICFP
2002
ACM
14 years 7 months ago
An expressive, scalable type theory for certified code
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...
Karl Crary, Joseph Vanderwaart
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
CSL
2004
Springer
13 years 7 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
VMCAI
2012
Springer
12 years 3 months ago
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
Tobias Nipkow