Pages that link to "Item:Q4170199"
From MaRDI portal
The following pages link to Minimal and Optimal Computations of Recursive Programs (Q4170199):
Displayed 32 items.
- Reversible session-based pi-calculus (Q492908) (← links)
- Infinitary combinatory reduction systems (Q550248) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- Complexity of the combinator reduction machine (Q1075052) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- Sequentiality in orthogonal term rewriting systems (Q1186735) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- A short scientific biography of Maurice Nivat (Q1605477) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- Studying Operational Models of Relaxed Concurrency (Q2830038) (← links)
- Reversing Single Sessions (Q3186584) (← links)
- Transformations of structures: An algebraic approach (Q3953162) (← links)
- (Q4139645) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Total unfolding: theory and applications (Q4764611) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Optimal normalization in orthogonal term rewriting systems (Q5055799) (← links)
- The combinator M and the Mockingbird lattice (Q5059139) (← links)
- Redexes are stable in the λ-calculus (Q5269004) (← links)
- Connections between a concrete and an abstract model of concurrent systems (Q5887511) (← links)