Sciweavers

122 search results - page 16 / 25
» Abductive Logic Programming by Nonground Rewrite Systems
Sort
View
LISP
2008
105views more  LISP 2008»
13 years 8 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
ENTCS
2008
116views more  ENTCS 2008»
13 years 9 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
WADT
1998
Springer
14 years 1 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...
FLOPS
2008
Springer
13 years 10 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
ENTCS
2008
106views more  ENTCS 2008»
13 years 9 months ago
Reduction Semantics and Formal Analysis of Orc Programs
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...
Musab AlTurki, José Meseguer