Sciweavers

ENTCS
2006
114views more  ENTCS 2006»
13 years 4 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
POPL
1997
ACM
13 years 8 months ago
Pizza into Java: Translating Theory into Practice
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is d...
Martin Odersky, Philip Wadler
SAIG
2001
Springer
13 years 8 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
VMCAI
2010
Springer
14 years 1 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
POPL
2010
ACM
14 years 1 months ago
Decision Procedures for Algebraic Data Types with Abstractions
Philippe Suter, Mirco Dotta, Viktor Kuncak
ICFP
2006
ACM
14 years 4 months ago
Simple unification-based type inference for GADTs
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
ICFP
2006
ACM
14 years 4 months ago
A pattern for almost compositional functions
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
Aarne Ranta, Björn Bringert
POPL
2004
ACM
14 years 4 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
POPL
2006
ACM
14 years 4 months ago
Stratified type inference for generalized algebraic data types
We offer a solution to the type inference problem for an extension of Hindley and Milner's type system with generalized algebraic data types. Our approach is in two strata. T...
François Pottier, Yann Régis-Gianas