Sciweavers

7 search results - page 1 / 2
» Explicit Polymorphism and CPS Conversion
Sort
View
POPL
1993
ACM
13 years 9 months ago
Explicit Polymorphism and CPS Conversion
Robert Harper, Mark Lillibridge
APLAS
2007
ACM
13 years 9 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama
FLOPS
2008
Springer
13 years 7 months ago
Typed Dynamic Control Operators for Delimited Continuations
Abstract. We study the dynamic control operators for delimited continuations, control and prompt. Based on recent developments on purely functional CPS translations for them, we in...
Yukiyoshi Kameyama, Takuo Yonezawa
TACS
1994
Springer
13 years 9 months ago
ML Typing, Explicit Polymorphism and Qualified Types
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
Mark P. Jones
APLAS
2008
ACM
13 years 7 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae