Sciweavers

1818 search results - page 147 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
LFCS
1994
Springer
14 years 2 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote
RTA
1993
Springer
14 years 2 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 2 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
WDAG
1993
Springer
98views Algorithms» more  WDAG 1993»
14 years 2 months ago
Fairness of N-party Synchronization and Its Implementation in a Distributed Environment
Fairness is an important concept in design and implementation of distributed systems. At the specification level, fairness usually serves as an assumption for proving liveness. At ...
Cheng Wu, Gregor von Bochmann, Ming Yu Yao
MFCS
1989
Springer
14 years 2 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan