Sciweavers

277 search results - page 17 / 56
» A First-Order Theory of Types and Polymorphism in Logic Prog...
Sort
View
ICFP
2006
ACM
14 years 7 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
ICFP
2003
ACM
14 years 7 months ago
MLF: raising ML to the power of system F
We propose a type system MLFthat generalizes ML with first-class polymorphism as in System F. Expressions may contain secondorder type annotations. Every typable expression admits...
Didier Le Botlan, Didier Rémy
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
ISMIS
1994
Springer
13 years 11 months ago
Reasoning About the Safety of Information: From Logical Formalization to Operational Definition
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
Laurence Cholvy, Robert Demolombe, Andrew J. I. Jo...
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 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