Sciweavers

1131 search results - page 71 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
ICFP
2005
ACM
14 years 10 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
CAV
2006
Springer
146views Hardware» more  CAV 2006»
14 years 2 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
DAGSTUHL
2003
14 years 8 days ago
Logical Languages for Data Mining
Data mining focuses on the development of methods and algorithms for such tasks as classification, clustering, rule induction, and discovery of associations. In the database fiel...
Fosca Giannotti, Giuseppe Manco, Jef Wijsen
AGP
1998
IEEE
14 years 3 months ago
Parsing with Non-Deterministic Functions
Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natura...
Rafael Caballero, Francisco Javier López-Fr...
POPL
2007
ACM
14 years 11 months ago
Lightweight fusion by fixed point promotion
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
Atsushi Ohori, Isao Sasano