10435 search results - page 48 / 2087 » Measuring system normality |
101
click to vote
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
113
click to vote
TYPES
2004
Springer
15 years 5 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
108
click to vote
ALP
1997
Springer
15 years 4 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
LICS
1990
IEEE
15 years 3 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
ILP
2000
Springer
15 years 3 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...