640 search results - page 4 / 128 » Logical types for untyped languages |
PPDP
2010
Springer
13 years 6 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
ISOTAS
1993
13 years 11 months ago
1993
We examine the problem of how to ensure behavioral consistency of an object-oriented system after its schema has been updated. The problem is viewed from the perspective of both t...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...