Pages that link to "Item:Q703856"
From MaRDI portal
The following pages link to The parametric lambda calculus. A metamodel for computation. (Q703856):
Displaying 25 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Relational graph models, Taylor expansion and extensionality (Q283769) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca (Q930863) (← links)
- Parametric \(\lambda \)-theories (Q930867) (← links)
- An irregular filter model (Q930872) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Eager functions as processes (Q2123050) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Abstracting models of strong normalization for classical calculi (Q2291828) (← links)
- Logical Semantics for Stability (Q2805169) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- Open Call-by-Value (Q3179293) (← links)
- (Q3300796) (← links)
- ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
- A Process-Model for Linear Programs (Q3638259) (← links)
- (Q4580329) (← links)
- (Q4625694) (← links)
- (Q5076060) (← links)
- (Q5076061) (← links)
- (Q5111316) (← links)
- Head reduction and normalization in a call-by-value lambda-calculus (Q5240183) (← links)
- Essential and relational models (Q5269000) (← links)
- Recursive Domain Equations of Filter Models (Q5448641) (← links)
