Sciweavers

973 search results - page 10 / 195
» Construction of a Semantic Model for a Typed Assembly Langua...
Sort
View
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
BIRTHDAY
2004
Springer
14 years 27 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...
PPDP
2005
Springer
14 years 29 days ago
Isolation-only transactions by typing and versioning
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
Pawel T. Wojciechowski
ICFP
2010
ACM
13 years 8 months ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones