Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

DOI10.1016/J.TCS.2008.01.018zbMATH Open1138.01318OpenAlexW1999149357MaRDI QIDQ930863FDOQ930863

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

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• An extension of basic functionality theory for \(\lambda\)-calculus
• A Soft Type Assignment System for λ-Calculus
• The parametric lambda calculus. A metamodel for computation.
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models
• Intersection types for \(\lambda\)-trees
• A filter lambda model and the completeness of type assignment
• Title not available (Why is that?)
• Comparing cubes of typed and type assignment systems
• Principal type scheme and unification for intersection type discipline
• Functional Characters of Solvable Terms
• Towards an intersection typed system à la Church
• A Filter Model for Concurrent $\lambda$-Calculus
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi
• Infinite \(\lambda\)-calculus and types
• Infinitary lambda calculus and discrimination of Berarducci trees.
• Title not available (Why is that?)
• Space-aware ambients and processes
• Title not available (Why is that?)
• Asynchronous Session Types and Progress for Object Oriented Languages
• Intersection and union types: Syntax and semantics
• Parametric parameter passing \(\lambda\)-calculus
• Lazy strong normalization
• Partial Types and Intervals
• Call-by-value Solvability
• Foundations of Software Science and Computation Structures
• Title not available (Why is that?)
• Theoretical Computer Science
• A characterization of F-complete type assignments
• The semantics of entailment omega
• Approximation theorems for intersection type systems
• Title not available (Why is that?)
• Principal type schemes for an extended type theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Type inference in polymorphic type discipline
• Completeness of type assignment in continuous lambda models
• Combining type disciplines
• A new type assignment for λ-terms
• Title not available (Why is that?)
• A fully abstract model for mobile ambients
• Title not available (Why is that?)
• Typed Lambda Calculi and Applications
• Strictness, totality, and non-standard-type inference
• Type inference, abstract interpretation and strictness analysis
• A type inference algorithm for a stratified polymorphic type discipline
• Typed lambda calculi and applications. 2nd international conference, TLCA '95, Edinburgh, GB, April 10--12, 1995. Proceedings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Type inference with recursive types: Syntax and semantics
• Title not available (Why is that?)
• Types for proofs and programs. International workshop, TYPES 2003, Torino, Italy, April 30 -- May 4, 2003. Revised selected papers.
• Processes, Terms and Cycles: Steps on the Road to Infinity
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Characterization of normal forms possessing inverse in the \(\lambda\)- \(\beta\)-\(\eta\)-calculus
• A discrimination algorithm inside \(\lambda -\beta\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Principal types and unification for simple intersection type systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fickle: Dynamic Object Re-classification
• Title not available (Why is that?)
• Bounded Session Types for Object Oriented Languages
• Trustworthy Global Computing
• A type inference algorithm for secure ambients
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Lambda calculus and intuitionistic linear logic
• Intersection types for explicit substitutions
• Intersection types and lambda models
• Structured Operational Semantics of a fragment of the language Scheme
• Security Types for Dynamic Web Data
• Security types for dynamic web data
• The call-by-value λ-calculus: a semantic investigation
• M\(^3\): mobility types for mobile processes in mobile ambients
• Title not available (Why is that?)
• International symposium on programming. 5th Colloquium, Turin, April 6-8, 1982. Proceedings
• Intersection types for combinatory logic
• Reduction of storage employed to represent families of information structures
• The ``relevance of intersection and union types
• Intersection types and domain operators
• Behavioural inverse limit \(\lambda\)-models
• 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.
• 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
• Title not available (Why is that?)
• Intersection typed \(\lambda \)-calculus
• Lazy logical semantics
• Type preorders and recursive terms
• A behavioural model for Klop's calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization theorems for a filter lambda model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A filter model for mobile processes
• A CUCH-machine: The automatic treatment of bound variables
• Notes on ?A CUCH-machine: The automatic treatment of bound variables?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preface
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• From Böhm's Theorem to Observational Equivalences
• Refinement types for program analysis
• 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
• Types for ambient and process mobility
• Title not available (Why is that?)
• Types for Proofs and Programs
• Encoding ℂDuce in the ℂπ-Calculus
• Boxed ambients with communication interfaces
• Theoretical computer science. 7th Italian conference, ICTCS 2001, Torino, Italy, October 4--6, 2001. Proceedings

This page was built for publication: Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930863)