Sciweavers

4370 search results - page 756 / 874
» Algebra of Logic Programming
Sort
View
FLOPS
1999
Springer
15 years 6 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
LOPSTR
1998
Springer
15 years 6 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
97
Voted
ICCAD
1996
IEEE
92views Hardware» more  ICCAD 1996»
15 years 6 months ago
Generation of BDDs from hardware algorithm descriptions
We propose a new method for generating BDDs from hardware algorithm descriptions written in a programming language. Our system can deal with control structures, such as conditiona...
Shin-ichi Minato
122
Voted
PADS
1996
ACM
15 years 6 months ago
Conservative Circuit Simulation on Shared-Memory Multiprocessors
We investigate conservative parallel discrete event simulations for logical circuits on shared-memory multiprocessors. For a first estimation of the possible speedup, we extend th...
Jörg Keller, Thomas Rauber, Bernd Rederlechne...
101
Voted
ICDE
1993
IEEE
103views Database» more  ICDE 1993»
15 years 6 months ago
IsaLog: A declarative language for complex objects with hierarchies
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
Paolo Atzeni, Luca Cabibbo, Giansalvatore Mecca