Sciweavers

360 search results - page 26 / 72
» Dependently Typed Programming in Agda
Sort
View
EUROGP
2005
Springer
123views Optimization» more  EUROGP 2005»
14 years 1 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 7 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
ICFP
2006
ACM
14 years 7 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
POPL
2004
ACM
14 years 8 months ago
Tridirectional typechecking
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...
Joshua Dunfield, Frank Pfenning
FP
1991
95views Formal Methods» more  FP 1991»
13 years 11 months ago
Making Functionality More General
The notion of functionality is not cast in stone, but depends upon what we have as types in our language. With partial equivalence relations (pers) as types we show that the funct...
Graham Hutton, Ed Voermans