Sciweavers

Share
JFP
2007
96views more  JFP 2007»
9 years 9 months ago
An extended comparative study of language support for generic programming
Ronald Garcia, Jaakko Järvi, Andrew Lumsdaine...
JFP
2007
94views more  JFP 2007»
9 years 9 months ago
A monadic framework for delimited continuations
Delimited continuations are more expressive than traditional abortive continuations and they apparently require a framework beyond traditional continuation-passing style (CPS). We...
R. Kent Dybvig, Simon L. Peyton Jones, A. M. R. Sa...
JFP
2007
103views more  JFP 2007»
9 years 9 months ago
Warnings for pattern matching
We examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches. We state the definition of these anomalies, building upon pattern matching semantics, ...
Luc Maranget
JFP
2007
72views more  JFP 2007»
9 years 9 months ago
On one-pass CPS transformations
Olivier Danvy, Kevin Millikin, Lasse R. Nielsen
JFP
2007
85views more  JFP 2007»
9 years 9 months ago
What is the meaning of these constant interruptions?
Asynchronous exceptions, or interrupts, are important for writing robust, modular programs, but are traditionally viewed as being difficult from a semantic perspective. In this ar...
Graham Hutton, Joel Wright
JFP
2007
126views more  JFP 2007»
9 years 9 months ago
Engineering Software Correctness
Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results fr...
Rex L. Page
JFP
2007
111views more  JFP 2007»
9 years 9 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
JFP
2007
110views more  JFP 2007»
9 years 9 months ago
Spreadsheet functional programming
The functional programming community has shown some interest in spreadsheets, but surprisingly no one seems to have considered making a standard spreadsheet, such as Excel, work w...
David Wakeling
JFP
2007
136views more  JFP 2007»
9 years 9 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...
JFP
2007
104views more  JFP 2007»
9 years 9 months ago
Understanding functional dependencies via constraint handling rules
Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules ...
Martin Sulzmann, Gregory J. Duck, Simon L. Peyton ...
books