Sciweavers

1131 search results - page 80 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
94
Voted
TLCA
2009
Springer
15 years 7 months ago
Initial Algebra Semantics for Cyclic Sharing Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
Makoto Hamana
FLOPS
2008
Springer
15 years 2 months ago
EasyCheck - Test Data for Free
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Jan Christiansen, Sebastian Fischer
95
Voted
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 7 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
94
Voted
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 17 days ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...
200
Voted
ICFP
2009
ACM
16 years 1 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur