Sciweavers

680 search results - page 36 / 136
» Types for the Ambient Calculus
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
BIRTHDAY
2004
Springer
14 years 1 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
GPCE
2004
Springer
14 years 1 months ago
A Fresh Calculus for Name Management
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
Davide Ancona, Eugenio Moggi
CIE
2008
Springer
13 years 9 months ago
Principal Typings for Explicit Substitutions Calculi
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
Daniel Lima Ventura, Mauricio Ayala-Rincón,...
IFIP
2004
Springer
14 years 1 months ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
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...
Benjamin Wack