Sciweavers

61 search results - page 2 / 13
» A Simple Semantics for ML Polymorphism
Sort
View
APLAS
2005
ACM
13 years 10 months ago
A Simple Semantics for Polymorphic Recursion
Abstract. Polymorphic recursion is a useful extension of HindleyMilner typing and has been incorporated in the functional programming language Haskell. It allows the expression of ...
William L. Harrison
POPL
1997
ACM
13 years 9 months ago
Behavioral Equivalence in the Polymorphic Pi-calculus
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
Benjamin C. Pierce, Davide Sangiorgi
ELP
1991
13 years 8 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 1 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ICFP
2003
ACM
14 years 4 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay