Sciweavers

ELP
1989
14 years 1 months ago
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
BSTRACTION, FUNCTION VARIABLES, AND SIMPLE UNIFICATION: Abstract Draft, 20 September 1989 Dale Miller Department of Computer and Information Science University of Pennsylvania Phil...
Dale Miller
CSL
1990
Springer
14 years 1 months ago
On the Reduction Theory for Average Case Complexity
This is an attempt to simplify and justify the notions of deterministicand randomized reductions, an attempt to derive these notions from (more or less) rst principles.
Andreas Blass, Yuri Gurevich
CSL
1989
Springer
14 years 1 months ago
Algebraic Operational Semantics and Occam
We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to ...
Yuri Gurevich, Lawrence S. Moss
ALP
1990
Springer
14 years 1 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
PLILP
1992
Springer
14 years 1 months ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl
PLILP
1992
Springer
14 years 1 months ago
Algorithmic Debugging for Lazy Functional Languages
Henrik Nilsson, Peter Fritzson