640 search results - page 16 / 128 » Logical types for untyped languages |
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
IJCAI
1993
13 years 9 months ago
1993
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
IANDC
2006
13 years 7 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...