20 search results - page 3 / 4 » Functional Programming With Higher-order Abstract Syntax and... |
138
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
128
Voted
POPL
2010
ACM
15 years 12 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
140
click to vote
TPHOL
2002
IEEE
15 years 7 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
134
Voted
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
117
Voted
PC
2006
15 years 2 months ago
2006
To manage load on large and dynamic networks we have developed Autonomous Mobile Programs (AMPs) that periodically use a cost model to decide where to execute. A disadvantage of d...