Sciweavers

1989 search results - page 168 / 398
» Set functions for functional logic programming
Sort
View
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
WCFLP
2005
ACM
16 years 1 days ago
A declarative debugger of incorrect answers for constraint functional-logic programs
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...
Rafael Caballero
PPDP
2007
Springer
16 years 18 days ago
Putting declarative programming into the web: translating curry to javascript
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
Michael Hanus
EMSOFT
2001
Springer
15 years 11 months ago
Giotto: A Time-Triggered Language for Embedded Programming
rovides an abstract programmer’s model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic soft...
Thomas A. Henzinger, Benjamin Horowitz, Christoph ...
DATE
1998
IEEE
73views Hardware» more  DATE 1998»
15 years 10 months ago
On Removing Multiple Redundancies in Combinational Circuits
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
David Ihsin Cheng