Completing Partial Combinatory Algebras with Unique Head-Normal Forms (1996)

Cached

Download Links

by Inge Bethke , Jan Willem Klop , Roel De Vrijer
Citations:3 - 1 self

Active Bibliography

12 Collapsing Partial Combinatory Algebras – Inge Bethke, Jan Willem Klop - 1996
1 Extending Partial Combinatory Algebras – Inge Bethke, Jan Willem Klop, Roel de Vrijer - 1999
On Completability of Partial – Andrea Asperti, Agata Ciabattoni
I Basic Categories 6 – J. R. B. Cockett - 2010
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988
19 From Total Equational to Partial First Order Logic – Maura Cerioli, Till Mossakowski, Horst Reichel - 1998
454 Rewriting – Nachum Dershowitz, David A. Plaisted - 2001
1 Meaningless Terms in Rewriting – Richard Kennaway, Y. Guo, M. Hagiya - 1999
Functions, Frames, and Interactions -- completing a λ-calculus-based purely functional language with respect to programming-in-the-large and interactions with runtime environments – Claus Reinke - 1998
7 Effective Applicative Structures – Andrea Asperti, Agata Ciabattoni, Piazza Porta, S. Donato - 1995
4 Introduction to Turing categories – J. R. B. Cockett, Pieter J. W. Hofstra
12 Proof Systems for Structured Specifications and Their Refinements – Michel Bidoit, Mara Victoria Cengarle, Rolf Hennicker - 1999
Partial Combinatory Algebras and Realizability Toposes – Pieter J. W. Hofstra - 2004
A lambda-to-CL Translation for Strong Normalization – Yohji Akama - 1997
12 Notions of computability at higher types I – John Longley - 2005
6 Proof pearl: de bruijn terms really do work – Michael Norrish, René Vestergaard - 2007
Graph Rewriting and Copying – Erik Barendsen, Sjaak Smetsers - 1992
2 A Geometric Proof of Confluence by Decreasing Diagrams – Jan Willem Klop, Vincent van Oostrom, Roel de Vrijer, Jan Willem, Klop Vincent, Oostrom Roel Vrijer
1 When are Two Rewrite Systems More than None? – Nachum Dershowitz