Sciweavers

525 search results - page 37 / 105
» Composing Programs in a Rewriting Logic for Declarative Prog...
Sort
View
ENTCS
2002
113views more  ENTCS 2002»
13 years 7 months ago
An Operational Semantics for Declarative Multi-Paradigm Languages
Practical declarative multi-paradigm languages combine the main features of functional, logic and concurrent programming (e.g., laziness, sharing, higher-order, logic variables, n...
Elvira Albert, Michael Hanus, Frank Huch, Javier O...
FLOPS
2010
Springer
14 years 2 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
ICLP
2005
Springer
14 years 1 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
AGP
1998
IEEE
14 years 2 days 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...
LPNMR
2001
Springer
14 years 7 days ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits