Sciweavers

199 search results - page 3 / 40
» Combining Strict and Soft Typing in Functional Programming
Sort
View
KES
2008
Springer
14 years 9 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
LACL
1998
Springer
15 years 1 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
TYPES
2004
Springer
15 years 2 months ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff
ESOP
2006
Springer
15 years 1 months ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
84
Voted
ICFP
2003
ACM
15 years 9 months ago
Discriminative sum types locate the source of type errors
We propose a type system for locating the source of type errors in an applied lambda calculus with ML-style polymorphism. The system is based on discriminative sum types--known fr...
Matthias Neubauer, Peter Thiemann