Sciweavers

IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
13 years 10 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
13 years 10 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
13 years 10 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers
IFL
2007
Springer
128views Formal Methods» more  IFL 2007»
13 years 10 months ago
The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
IFL
2007
Springer
110views Formal Methods» more  IFL 2007»
13 years 10 months ago
XHaskell - Adding Regular Expression Types to Haskell
Martin Sulzmann, Kenny Zhuo Ming Lu
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
13 years 10 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
13 years 10 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
13 years 10 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson