1 option
Typed Lambda Calculi and Applications : 8th International Conference, TLCA 2007, Paris, France, June 26-28, 2007, Proceedings / edited by Simona Ronchi Della Rocca.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 4583.
- Theoretical Computer Science and General Issues ; 4583
- Language:
- English
- Subjects (All):
- Logic, Symbolic and mathematical.
- Computer logic.
- Computer programming.
- Programming languages (Electronic computers).
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Local Subjects:
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Programming Techniques.
- Programming Languages, Compilers, Interpreters.
- Physical Description:
- 1 online resource (X, 400 pages).
- Edition:
- First edition 2007.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
- System Details:
- text file PDF
- Contents:
- On a Logical Foundation for Explicit Substitutions
- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
- Strong Normalization and Equi-(Co)Inductive Types
- Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
- The Safe Lambda Calculus
- Intuitionistic Refinement Calculus
- Computation by Prophecy
- An Arithmetical Proof of the Strong Normalization for the ?-Calculus with Recursive Equations on Types
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
- Completing Herbelin's Programme
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
- Ludics is a Model for the Finitary Linear Pi-Calculus
- Differential Structure in Models of Multiplicative Biadditive Intuitionistic Linear Logic
- The Omega Rule is -Complete in the ??-Calculus
- Weakly Distributive Domains
- Initial Algebra Semantics Is Enough!
- A Substructural Type System for Delimited Continuations
- The Inhabitation Problem for Rank Two Intersection Types
- Extensional Rewriting with Sums
- Higher-Order Logic Programming Languages with Constraints: A Semantics
- Predicative Analysis of Feasibility and Diagonalization
- Edifices and Full Abstraction for the Symmetric Interaction Combinators
- Two Session Typing Systems for Higher-Order Mobile Processes
- An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
- Polynomial Size Analysis of First-Order Functions
- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
- Convolution -Calculus.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-73228-0
- 9783540732280
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.