Sciweavers

HASKELL
2007
ACM
14 years 3 months ago
Comprehensive comprehensions
We propose an extension to list comprehensions that makes it easy to express the kind of queries one would write in SQL using ORDER BY, GROUP BY, and LIMIT. Our extension adds exp...
Simon L. Peyton Jones, Philip Wadler
HASKELL
2007
ACM
14 years 3 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
HASKELL
2007
ACM
14 years 3 months ago
Haskell program coverage
We describe the design, implementation and use of HPC, a toolkit to record and display Haskell Program Coverage. HPC includes tools that instrument Haskell programs to record prog...
Andy Gill, Colin Runciman
HASKELL
2007
ACM
14 years 3 months ago
A shortcut fusion rule for circular program calculation
João Paulo Fernandes, Alberto Pardo, Jo&ati...
ESOP
2009
Springer
14 years 3 months ago
Type-Based Automated Verification of Authenticity in Cryptographic Protocols
Gordon and Jeffrey have proposed a type and effect system for checking authenticity in cryptographic protocols. The type system reduces the protocol verification problem to the typ...
Daisuke Kikuchi, Naoki Kobayashi
ESOP
2009
Springer
14 years 3 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
ESOP
2009
Springer
14 years 3 months ago
Existential Quantification for Variant Ownership
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, me...
Nicholas R. Cameron, Sophia Drossopoulou
ESOP
2009
Springer
14 years 3 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
ESOP
2009
Springer
14 years 3 months ago
Handlers of Algebraic Effects
We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include ...
Gordon D. Plotkin, Matija Pretnar
ESOP
2009
Springer
14 years 3 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster