Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
From MaRDI portal
Publication:930863
DOI10.1016/j.tcs.2008.01.018zbMath1138.01318OpenAlexW1999149357MaRDI QIDQ930863
Stefano Berardi, Ugo de'Liguoro
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.018
Cites Work
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi
- The parametric lambda calculus. A metamodel for computation.
- Types for proofs and programs. International workshop, TYPES 2003, Torino, Italy, April 30 -- May 4, 2003. Revised selected papers.
- Type inference with recursive types: Syntax and semantics
- Principal type schemes for an extended type theory
- Completeness of type assignment in continuous lambda models
- Space-aware ambients and processes
- Security types for dynamic web data
- A characterization of F-complete type assignments
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Principal type scheme and unification for intersection type discipline
- An extension of basic functionality theory for \(\lambda\)-calculus
- International symposium on programming. 5th Colloquium, Turin, April 6-8, 1982. Proceedings
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Intersection types for combinatory logic
- Reduction of storage employed to represent families of information structures
- Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
- A discrimination algorithm inside \(\lambda -\beta\)-calculus
- Infinite \(\lambda\)-calculus and types
- Type inference, abstract interpretation and strictness analysis
- Combining type disciplines
- A type inference algorithm for a stratified polymorphic type discipline
- Comparing cubes of typed and type assignment systems
- Lambda calculus and intuitionistic linear logic
- The ``relevance of intersection and union types
- The semantics of entailment omega
- Intersection types and domain operators
- Behavioural inverse limit \(\lambda\)-models
- Typed lambda calculi and applications. 2nd international conference, TLCA '95, Edinburgh, GB, April 10--12, 1995. Proceedings
- Types for proofs and programs. International workshop TYPES '95, Torino, Italy, June 5--8, 1995. Selected papers
- On the semantics of polymorphism
- A data structure formalization through generating function
- Alpha-conversion and typability
- Discrimination by parallel observers: the algorithm.
- Infinitary lambda calculus and discrimination of Berarducci trees.
- Intersection types for explicit substitutions
- Parametric parameter passing \(\lambda\)-calculus
- Intersection and union types: Syntax and semantics
- Principal types and unification for simple intersection type systems
- Intersection types and lambda models
- Intersection-types à la Church
- Typed lambda calculi and applications. 8th international conference, TLCA 2007, Paris, France, June 26--28, 2007. Proceedings.
- Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12--14, 2005. Proceedings.
- Compositional characterisations of \(\lambda\)-terms using intersection types
- Approximation Theorems for Intersection Type Systems
- Fickle: Dynamic Object Re-classification
- A Type Inference Algorithm for Secure Ambients
- A Fully Abstract Model for Mobile Ambients
- Intersection Typed λ-calculus
- A new type assignment for λ-terms
- A filter lambda model and the completeness of type assignment
- Partial Types and Intervals
- Bounded Session Types for Object Oriented Languages
- A Soft Type Assignment System for λ-Calculus
- Security Types for Dynamic Web Data
- Characterization theorems for a filter lambda model
- Functional Characters of Solvable Terms
- A Filter Model for Concurrent $\lambda$-Calculus
- Structured Operational Semantics of a fragment of the language Scheme
- A filter model for mobile processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A CUCH-machine: The automatic treatment of bound variables
- Notes on ?A CUCH-machine: The automatic treatment of bound variables?
- Preface
- The call-by-value λ-calculus: a semantic investigation
- From Böhm's Theorem to Observational Equivalences
- Call-by-value Solvability
- Refinement types for program analysis
- Type inference in polymorphic type discipline
- Intersection and union types
- May and must convergency in concurrent λ-calculus
- A complete characterization of complete intersection-type preorders
- Mathematical Foundations of Computer Science 2004
- Trustworthy Global Computing
- Asynchronous Session Types and Progress for Object Oriented Languages
- Types for ambient and process mobility
- Typed Lambda Calculi and Applications
- Types for Proofs and Programs
- Encoding ℂDuce in the ℂπ-Calculus
- Boxed ambients with communication interfaces
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Theoretical Computer Science
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Foundations of Software Science and Computation Structures
- Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings
- Intersection types for \(\lambda\)-trees
- Strictness, totality, and non-standard-type inference
This page was built for publication: Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
