Sciweavers

15 search results - page 2 / 3
» Full Abstraction for Polymorphic Pi-Calculus
Sort
View
FPCA
1989
13 years 9 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
ASPLOS
2006
ACM
13 years 11 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
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
TPHOL
2007
IEEE
13 years 12 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka
FLOPS
2010
Springer
14 years 14 days ago
A Church-Style Intermediate Language for MLF
MLF is a type system that seamlessly merges ML-style implicit but second-class polymorphism with System F explicit first-class polymorphism. We present xMLF, a Church-style versi...
Didier Rémy, Boris Yakobowski