5506 search results - page 769 / 1102 » Minimal Logic Programs |
184
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
170
click to vote
LICS
2007
IEEE
16 years 29 days ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
147
click to vote
LICS
2007
IEEE
16 years 29 days ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
176
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
271
click to vote
ILP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...