Sciweavers

8021 search results - page 101 / 1605
» A Type System for Tom
Sort
View
CSL
2004
Springer
14 years 2 months ago
Fixed Points of Type Constructors and Primitive Recursion
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
Andreas Abel, Ralph Matthes
FOAL
2007
ACM
13 years 11 months ago
Typing for a minimal aspect language: preliminary report
We present a preliminary report on typing systems for polyadic µABC, aspect oriented programming—pointcuts and advice—and nothing else. Tuples of uninterpreted names are used...
Peter Hui, James Riely
JFP
2006
103views more  JFP 2006»
13 years 9 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 9 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
POPL
2004
ACM
14 years 9 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier