265 search results - page 33 / 53 » Lambda calculus with patterns |
91
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
106
click to vote
ECOOP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
104
click to vote
GECCO
2008
Springer
15 years 25 days 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...
164
click to vote
SCP
2011
14 years 6 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
103
click to vote
ENTCS
2008
14 years 11 months ago
2008
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...