Sciweavers

3001 search results - page 40 / 601
» Recursive type generativity
Sort
View
GI
2009
Springer
15 years 4 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...
LICS
1994
IEEE
15 years 4 months ago
Efficient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
Jens Palsberg
TAPSOFT
1991
Springer
15 years 3 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
CAV
2008
Springer
130views Hardware» more  CAV 2008»
15 years 1 months ago
A Hybrid Type System for Lock-Freedom of Mobile Processes
We propose a type system for lock-freedom in the -calculus, which guarantees that certain communications will eventually succeed. Distinguishing features of our type system are: it...
Naoki Kobayashi, Davide Sangiorgi
CORR
2010
Springer
121views Education» more  CORR 2010»
14 years 9 months ago
MiniAgda: Integrating Sized and Dependent Types
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
Andreas Abel