Pages that link to "Item:Q1383145"
From MaRDI portal
The following pages link to Lambda calculus with explicit recursion (Q1383145):
Displaying 18 items.
- A concurrent lambda calculus with futures (Q860851) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Skew confluence and the lambda calculus with letrec (Q1849854) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Computational soundness of a call by name calculus of recursively-scoped records (Q2873682) (← links)
- Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
- Expressibility in the lambda calculus with \(\mu\) (Q2958385) (← links)
- Safety of Nöcker's strictness analysis (Q3520168) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- Convergence in infinitary term graph rewriting systems is simple (Q4585010) (← links)
- Term graph rewriting (Q4645801) (← links)
- Term-Graph Anti-Unification (Q4993335) (← links)
- Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (Q5240138) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)
- A calculus of open modules: call-by-need strategy and confluence (Q5756978) (← links)
- Explicit cyclic substitutions (Q5881174) (← links)