Sciweavers

ENTCS
2007
100views more  ENTCS 2007»
13 years 4 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
JFP
2006
103views more  JFP 2006»
13 years 4 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
JFP
2006
80views more  JFP 2006»
13 years 4 months ago
Static analysis for path correctness of XML queries
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages...
Dario Colazzo, Giorgio Ghelli, Paolo Manghi, Carlo...
JFP
2006
88views more  JFP 2006»
13 years 4 months ago
Type-based confinement
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...
Tian Zhao, Jens Palsberg, Jan Vitek
ENTCS
2006
120views more  ENTCS 2006»
13 years 4 months ago
SCHOOL: a Small Chorded Object-Oriented Language
Chords are a declarative synchronisation construct based on the Join-Calculus, available in the programming language C. To our knowledge, chords have no formal model in an object-...
Sophia Drossopoulou, Alexis Petrounias, Alex Buckl...
ENTCS
2008
97views more  ENTCS 2008»
13 years 4 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic
GPCE
2008
Springer
13 years 5 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
ICFP
2010
ACM
13 years 5 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ICFP
2010
ACM
13 years 5 months ago
Logical types for untyped languages
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
Sam Tobin-Hochstadt, Matthias Felleisen
SE
2007
13 years 5 months ago
Rules for type-checking of parametric polymorphism in EMF generics
Abstract: The Eclipse infrastructure for modeling is based on EMF, an implementation of Essential MOF, the OMG standard for metamodeling. A recent addition to EMF has been parametr...
Miguel Garcia