The following pages link to Jan Willem Klop (Q549184):
Displayed 50 items.
- On equal \(\mu \)-terms (Q549186) (← links)
- The free process algebra generated by \(\delta \), \(\epsilon\) and \(\tau \) (Q549205) (← links)
- Obituary: Nicolaas Govert de Bruijn (1918--2012). Mathematician, computer scientist, logician (Q740456) (← links)
- De Bruijn's weak diamond property revisited (Q740482) (← links)
- Item:Q549184 (redirect page) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- Computing with actions and communications (Q998092) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- Algebra of communicating processes with abstraction (Q1067408) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Unique normal forms for lambda calculus with surjective pairing (Q1117204) (← links)
- Invertible terms in the lambda calculus (Q1145689) (← links)
- An analysis of loop checking mechanisms for logic programs (Q1177923) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Church-Rosser strategies in the lambda calculus (Q1256442) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- Diagram techniques for confluence (Q1271472) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Infinitary lambda calculus (Q1392145) (← links)
- Bisimilarity in term graph rewriting. (Q1854321) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Transfinite reductions in orthogonal term rewriting systems (Q1893727) (← links)
- Comparing curried and uncurried rewriting (Q1918496) (← links)
- Highlights in infinitary rewriting and lambda calculus (Q1929230) (← links)
- Transducer degrees: atoms, infima and suprema (Q2182680) (← links)
- Braids via term rewriting (Q2422032) (← links)
- Degrees of Infinite Words, Polynomials and Atoms (Q2817385) (← links)
- (Q2849584) (← links)
- (Q2855523) (← links)
- Automatic Sequences and Zip-Specifications (Q2986809) (← links)
- (Q3012528) (← links)
- (Q3028334) (← links)
- (Q3042376) (← links)
- Decidability of bisimulation equivalence for process generating context-free languages (Q3140021) (← links)
- (Q3188961) (← links)
- (Q3330491) (← links)
- (Q3341873) (← links)
- Degrees of Transducibility (Q3449352) (← links)
- Reduction Strategies and Acyclicity (Q3608813) (← links)
- Proving Infinitary Normalization (Q3638246) (← links)
- (Q3657410) (← links)
- (Q3664413) (← links)
- (Q3666247) (← links)