Sciweavers

79 search results - page 5 / 16
» Intersection Types and Lambda Theories
Sort
View
TYPES
2007
Springer
14 years 1 months ago
On Normalization by Evaluation for Object Calculi
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
Jan Schwinghammer
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
13 years 11 months ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin
FPCA
1989
13 years 11 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
ENTCS
2007
102views more  ENTCS 2007»
13 years 7 months ago
Encoding Functional Relations in Scunak
We describe how a set-theoretic foundation for mathematics can be encoded in the new system Scunak. We then discuss an encoding of the construction of functions as functional relat...
Chad E. Brown
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 10 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner