Sciweavers

117 search results - page 1 / 24
» Extracting Programs with Exceptions in an Impredicative Type...
Sort
View
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
13 years 8 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin
ICFP
2005
ACM
14 years 4 months ago
Qualified types for MLF
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
Andres Löh, Daan Leijen
ICFP
2006
ACM
14 years 4 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. ...
APAL
2005
90views more  APAL 2005»
13 years 4 months ago
Explicit mathematics: power types and overloading
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
Thomas Studer
APLAS
2006
ACM
13 years 8 months ago
Type and Effect System for Multi-staged Exceptions
Abstract. We present a type and effect system for a multi-staged language with exceptions. The proposed type and effect system checks if we safely synthesize complex controls with ...
Hyunjun Eo, Ik-Soon Kim, Kwangkeun Yi