Sciweavers

1131 search results - page 8 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
ICFP
2005
ACM
14 years 8 days ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
JLP
2007
114views more  JLP 2007»
13 years 6 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
13 years 10 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 6 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 6 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano