5,039 research outputs found
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
We study normalising reduction strategies for infinitary Combinatory
Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and
needed-fair strategies are normalising for orthogonal, fully-extended iCRSs.
These facts properly generalise a number of results on normalising strategies
in first-order infinitary rewriting and provide the first examples of
normalising strategies for infinitary lambda calculus
CRSX - Combinatory Reduction Systems with Extensions
Combinatory Reduction Systems with Extensions (CRSX) is a system
available from http://crsx.sourceforge.net and characterized by
the following properties:
- Higher-order rewriting engine based on pure Combinatory Reduction Systems with full strong reduction (but no specified reduction strategy).
- Rule and term syntax based on lambda-calculus and term rewriting conventions including Unicode support.
- Strict checking and declaration requirements to avoid idiosyncratic errors in rewrite rules.
- Interpreter is implemented in Java 5 and usable stand-alone as well as from an Eclipse plugin (under development).
- Includes a custom parser generator (front-end to JavaCC parser generator) designed to ease parsing directly into higher-order abstract syntax (as well as permitting the use of custom syntax in rules files).
- Experimental (and evolving) sort system to help rule management.
- Compiler from (well-sorted deterministic subset of) CRSX to stand-alone C code
Asymptotically almost all \lambda-terms are strongly normalizing
We present quantitative analysis of various (syntactic and behavioral)
properties of random \lambda-terms. Our main results are that asymptotically
all the terms are strongly normalizing and that any fixed closed term almost
never appears in a random term. Surprisingly, in combinatory logic (the
translation of the \lambda-calculus into combinators), the result is exactly
opposite. We show that almost all terms are not strongly normalizing. This is
due to the fact that any fixed combinator almost always appears in a random
combinator
A herbrandized functional interpretation of classical first-order logic
We introduce a new typed combinatory calculus with a type constructor that, to each type σ, associates the star type σ^∗ of the nonempty finite subsets of elements of type σ. We prove that this calculus enjoys the properties of strong normalization and confluence. With the aid of this star combinatory calculus, we define a functional interpretation of first-order predicate logic and prove a corresponding soundness theorem. It is seen that each theorem of classical first-order logic is connected with certain formulas which are tautological in character. As a corollary, we reprove Herbrand’s theorem on the extraction of terms from classically provable existential statements.info:eu-repo/semantics/publishedVersio
Are there Hilbert-style Pure Type Systems?
For many a natural deduction style logic there is a Hilbert-style logic that
is equivalent to it in that it has the same theorems (i.e. valid judgements
with empty contexts). For intuitionistic logic, the axioms of the equivalent
Hilbert-style logic can be propositions which are also known as the types of
the combinators I, K and S. Hilbert-style versions of illative combinatory
logic have formulations with axioms that are actual type statements for I, K
and S. As pure type systems (PTSs)are, in a sense, equivalent to systems of
illative combinatory logic, it might be thought that Hilbert-style PTSs (HPTSs)
could be based in a similar way. This paper shows that some PTSs have very
trivial equivalent HPTSs, with only the axioms as theorems and that for many
PTSs no equivalent HPTS can exist. Most commonly used PTSs belong to these two
classes. For some PTSs however, including lambda* and the PTS at the basis of
the proof assistant Coq, there is a nontrivial equivalent HPTS, with axioms
that are type statements for I, K and S.Comment: Accepted in Logical Methods in Computer Scienc
Comparing Böhm-Like Trees
Extending the infinitary rewriting definition of Böhm-like trees to infinitary Combinatory Reduction Systems (iCRSs), we show that each Böhm-like tree defined by means of infinitary rewriting can also be defined by means of a direct approximant function. In addition, we show that counterexamples exists to the reverse implication
- …