Sciweavers

15 search results - page 3 / 3
» Full Abstraction for Polymorphic Pi-Calculus
Sort
View
APLAS
2004
ACM
14 years 27 days ago
Automatic Generation of Editors for Higher-Order Data Structures
With generic functional programming techniques, we have eased GUI programming by constructing a programming toolkit with which one can create GUIs in an abstract and compositional ...
Peter Achten, Marko C. J. D. van Eekelen, Rinus Pl...
JMLC
2000
Springer
13 years 11 months ago
Composable Message Semantics in Oberon
Most object-oriented languages offer a limited number of invocation semantics. At best, they define a default mode of synchronous invocation, plus some keywords to express addition...
Markus Hof
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
ESOP
2009
Springer
14 years 2 months ago
An Interval-Based Inference of Variant Parametric Types
Abstract. Variant parametric types (VPT) represent the successful result of combining subtype polymorphism with parametric polymorphism to support a more flexible subtyping for Ja...
Florin Craciun, Wei-Ngan Chin, Guanhua He, Shengch...
ICFP
1999
ACM
13 years 11 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil