Sciweavers

584 search results - page 27 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ESOP
2007
Springer
15 years 3 months ago
A Rewriting Semantics for Type Inference
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
George Kuan, David MacQueen, Robert Bruce Findler
AGP
1997
IEEE
15 years 1 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
100
Voted
ENTCS
2008
106views more  ENTCS 2008»
14 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
ALP
1997
Springer
15 years 1 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
81
Voted
IFIP
2004
Springer
15 years 3 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi