Pages that link to "Item:Q4167525"
From MaRDI portal
The following pages link to A new implementation technique for applicative languages (Q4167525):
Displaying 11 items.
- Using transformations in the implementation of higher-order functions (Q4939691) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Redex capturing in term graph rewriting (concise version) (Q5055745) (← links)
- (Q5089007) (← links)
- Normal-order reduction grammars (Q5372004) (← links)
- Functional Semantics (Q5410451) (← links)
- Programming in the λ-Calculus: From Church to Scott and Back (Q5410454) (← links)
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators (Q5958469) (← links)
- Correctness of procedure representations in higher-order assembly language (Q6116577) (← links)
- Call-by-value combinatory logic and the lambda-value calculus (Q6171751) (← links)
- Disproving termination of non-erasing sole combinatory calculus with tree automata (Q6666803) (← links)