Sciweavers

856 search results - page 39 / 172
» Dependent Types in Practical Programming
Sort
View
EUROGP
2005
Springer
123views Optimization» more  EUROGP 2005»
14 years 2 months ago
An Algorithmic Chemistry for Genetic Programming
Abstract. Genetic Programming has been slow at realizing other programming paradigms than conventional, deterministic, sequential vonNeumann type algorithms. In this contribution w...
Christian Lasarczyk, Wolfgang Banzhaf
ICFP
2001
ACM
14 years 8 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
FROCOS
2011
Springer
12 years 8 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop

Lab
597views
15 years 8 months ago
Programming Languages Team (PLT)
PLT develops foundations for building reliable, high-performance software. Foundations include practices, languages, semantics, implementation techniques and type systems. To dem...
JFP
2008
97views more  JFP 2008»
13 years 7 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey