Sciweavers

4835 search results - page 431 / 967
» Refactoring Functional Programs
Sort
View
ICFP
2002
ACM
16 years 7 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
201
Voted
ICFP
2002
ACM
16 years 7 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
LATA
2009
Springer
16 years 2 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
PPDP
2009
Springer
16 years 2 months ago
Future contracts
Many recent research projects focus on language support for behavioral software contracts, that is, assertions that govern the boundaries between software building blocks such as ...
Christos Dimoulas, Riccardo Pucella, Matthias Fell...
193
Voted
SCAM
2006
IEEE
16 years 1 months ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis