The following pages link to Simonetta Ronchi della Rocca (Q1198660):
Displaying 50 items.
- (Q276267) (redirect page) (← links)
- (Q1240553) (redirect page) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- The parametric lambda calculus. A metamodel for computation. (Q703856) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- Reduction of storage employed to represent families of information structures (Q1240554) (← links)
- A discrimination algorithm inside \(\lambda -\beta\)-calculus (Q1257009) (← links)
- (Q1322475) (redirect page) (← links)
- A type inference algorithm for a stratified polymorphic type discipline (Q1322476) (← links)
- Comparing cubes of typed and type assignment systems (Q1365249) (← links)
- Lambda calculus and intuitionistic linear logic (Q1378432) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- (Q1854261) (redirect page) (← links)
- Alpha-conversion and typability (Q1854262) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- Call-by-value, elementary time and intersection types (Q1990483) (← links)
- Intersection-types à la Church (Q2381503) (← links)
- Logical Semantics for Stability (Q2805169) (← links)
- Intersection Typed λ-calculus (Q2842843) (← links)
- (Q2847789) (← links)
- (Q2851086) (← links)
- (Q2851088) (← links)
- Soft Linear Logic and Polynomial Complexity Classes (Q2866738) (← links)
- An Implicit Characterization of PSPACE (Q2946666) (← links)
- Linearity, Non-determinism and Solvability (Q3000282) (← links)
- (Q3024851) (← links)
- (Q3142164) (← links)
- A logical account of pspace (Q3189832) (← links)
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158) (← links)
- The Inhabitation Problem for Non-idempotent Intersection Types (Q3190172) (← links)
- Solvability in Resource Lambda-Calculus (Q3557862) (← links)
- A Soft Type Assignment System for λ-Calculus (Q3608417) (← links)
- Light Logics and the Call-by-Value Lambda Calculus (Q3623002) (← links)
- Type Inference for a Polynomial Lambda Calculus (Q3638250) (← links)
- Intersection, Universally Quantified, and Reference Types (Q3644750) (← links)
- From light logics to type assignments: a case study (Q3644842) (← links)
- Characterization theorems for a filter lambda model (Q3657969) (← links)
- (Q3786467) (← links)
- (Q3816053) (← links)
- (Q3858241) (← links)
- (Q3922648) (← links)
- (Q4018065) (← links)
- (Q4035237) (← links)
- (Q4066583) (← links)
- (Q4175261) (← links)
- Structured Operational Semantics of a fragment of the language Scheme (Q4236882) (← links)
- (Q4457451) (← links)
- (Q4501164) (← links)
- (Q4580327) (← links)
