Sciweavers

5415 search results - page 218 / 1083
» The Implementation of Functional Programming Languages
Sort
View
POPL
2009
ACM
16 years 1 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
AOSD
2007
ACM
15 years 5 months ago
Open bisimulation for aspects
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
Radha Jagadeesan, Corin Pitcher, James Riely
ICFP
2009
ACM
16 years 1 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
SIGADA
2005
Springer
15 years 6 months ago
Optimizing the SPARK program slicer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
Ricky E. Sward, Leemon C. Baird III
LOPSTR
2007
Springer
15 years 7 months ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen