scientific article
From MaRDI portal
Publication:2723890
zbMath0964.68070MaRDI QIDQ2723890
Publication date: 8 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation ⋮ Harnessing First Order Termination Provers Using Higher Order Dependency Pairs ⋮ Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding ⋮ Size-based termination of higher-order rewriting ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ A Lambda-Free Higher-Order Recursive Path Order ⋮ The Computability Path Ordering: The End of a Quest ⋮ Enhancing dependency pair method using strong computability in simply-typed term rewriting ⋮ Unnamed Item ⋮ Inductive-data-type systems ⋮ Theory and practice of second-order rewriting: foundation, evolution, and SOL ⋮ Stochastic analysis of a thermoelastic problem in functionally graded plates with uncertain material properties ⋮ On the Relation between Sized-Types Based Termination and Semantic Labelling ⋮ The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
Uses Software
This page was built for publication:
