scientific article; zbMATH DE number 3730111
From MaRDI portal
Publication:3918095
Cited in
(only showing first 100 items - show all)- An extension of Klop's counterexample to the Church-Rosser property to -calculus with other ordered pair combinators
- Possible forms of evaluation or reduction in Martin-Löf type theory
- Needed reduction and spine strategies for the lambda calculus
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus
- Counterexamples to termination for the direct sum of term rewriting systems
- Conditional rewrite rules: Confluence and termination
- Unique normal forms for lambda calculus with surjective pairing
- Higher-order rewrite systems and their confluence
- A notation for lambda terms. A generalization of environments
- On the expressive power of finitely typed and universally polymorphic recursive procedures
- A criterion for proving noetherianity of a relation
- Conditional rewriting logic as a unified model of concurrency
- Confluence of the lambda calculus with left-linear algebraic rewriting
- Adding algebraic rewriting to the untyped lambda calculus
- Capturing strong reduction in director string calculus
- How to decide the lark
- Term-rewriting systems with rule priorities
- Diagram techniques for confluence
- Explicit substitution. On the edge of strong normalization
- Orders, reduction graphs and spectra
- Perpetual reductions in -calculus
- Combinatory reduction systems: Introduction and survey
- Eta-conversion for the languages of explicit substitutions
- Reduction and unification in lambda calculi with a general notion of subtype
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints
- Interaction systems II: The practice of optimal reductions
- Comparing cubes of typed and type assignment systems
- On the Jacopini technique
- Lambda calculus with explicit recursion
- Interaction nets and term-rewriting systems
- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- A confluent calculus for concurrent constraint programming
- Developing developments
- A formalised first-order confluence proof for the \(\lambda\)-calculus using one-sorted variable names.
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions
- Partial completion of equational theories
- Relating conflict-free stable transition and event models via redex families
- Programs as data structures in \(\lambda\)SF-calculus
- Strong normalization through intersection types and memory
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Normalisation for higher-order calculi with explicit substitutions
- A proof of the leftmost reduction theorem for -calculus
- Sequential evaluation strategies for parallel-or and related reduction systems
- Algorithms and reductions for rewriting problems. II.
- Descendants and origins in term rewriting.
- Perpetuality and uniform normalization in orthogonal rewrite systems
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
- Conservation and uniform normalization in lambda calculi with erasing reductions
- Parametric parameter passing \(\lambda\)-calculus
- Normal forms in combinatory logic
- NP-completeness of a combinator optimization problem
- From diagrammatic confluence to modularity
- Highlights in infinitary rewriting and lambda calculus
- Theory and practice of second-order rewriting: foundation, evolution, and SOL
- Functional pearl: the distributive \(\lambda\)-calculus
- A type-assignment of linear erasure and duplication
- Spinal atomic \(\lambda\)-calculus
- New proofs of important theorems of untyped extensional \(\lambda\) calculus
- Linear numeral systems
- (In)efficiency and reasonable cost models
- A formal algorithmic language FALGOL. Thirty years after
- Braids via term rewriting
- Expression reduction systems with patterns
- The conflict-free reduction geometry
- A higher-order calculus and theory abstraction
- The mechanisation of Barendregt-style equational proofs (the residual perspective)
- Structuring operational semantics: simplification and computation
- Complete laziness: a natural semantics
- A confluent rewriting system having no computable, one-step, normalizing strategy
- Three Syntactic Theories for Combinatory Graph Reduction
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
- The Prismoid of Resources
- Converting between Combinatory Reduction Systems and Big Step Semantics
- First-class patterns
- Towards ``mouldable code via nested code graph transformation
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus
- The geometry of orthogonal reduction spaces
- A confluent reduction for the extensional typed -calculus with pairs, sums, recursion and terminal object
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- R n - and G n -logics
- The variable containment problem
- Development closed critical pairs
- Theoretical Pearl Yet yet a counterexample for λ+SP
- The dynamics of information exchange dialogues
- Explicit substitutions
- Decreasing diagrams with two labels are complete for confluence of countable systems
- Optimal reductions in interaction systems
- Classes of equational programs that compile into efficient machine code
- Transfinite reductions in orthogonal term rewriting systems
- Adding algebraic rewriting to the untyped lambda calculus (extended abstract)
- On confluence for weakly normalizing systems
- Open problems in rewriting
- More problems in rewriting
- A termination ordering for higher order rewrite systems
- Proving the genericity lemma by leftmost reduction is simple
- Problems in rewriting III
- Higher-order narrowing with definitional trees
- Combinatory reduction systems with explicit substitution that preserve strong normalisation
- Higher-order families
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3918095)
