12 search results - page 1 / 3 » Realisability for Induction and Coinduction with Application... |
JUCS
2010
13 years 2 months ago
2010
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...
CIE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...