Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
36
views
0
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,683
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Typed Lambda Calculi and Applications
other
Editor(s):
Luke Ong
Publication date
(Print):
2011
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Applications of SAXS
Author and book information
Book
ISBN (Print):
978-3-642-21690-9
ISBN (Electronic):
978-3-642-21691-6
Publication date (Print):
2011
DOI:
10.1007/978-3-642-21691-6
SO-VID:
fa73c86e-d9b6-4cb2-bcc6-a0c97539ecbe
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
A Survey of Classical Realizability
pp. 3
Tree Automata, (Dis-)Equality Constraints and Term Rewriting
pp. 6
Rewriting in Practice
pp. 9
Combining Proofs and Programs
pp. 10
Higher-Order Dynamic Pattern Unification for Dependent Types and Records
pp. 27
Classical Call-by-Need and Duality
pp. 45
Homotopy-Theoretic Models of Type Theory
pp. 61
Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus
pp. 76
Orthogonality and Boolean Algebras for Deduction Modulo
pp. 107
Realizability Proof for Normalization of Full Differential Linear Logic
pp. 123
Controlling Program Extraction in Light Logics
pp. 138
An Elementary Affine λ-Calculus with Multithreading and Side Effects
pp. 153
Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion
pp. 169
Finite Combinatory Logic with Intersection Types
pp. 184
Linear Lambda Calculus and Deep Inference
pp. 198
Partiality, State and Dependent Types
pp. 213
A Filter Model for the λμ-Calculus
pp. 229
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming
Similar content
4,683
Optimal method of urgent decompression of the collecting system for obstruction and infection due to ureteral calculi.
Authors:
M Pearle
,
H Pierce
,
G L Miller
…
Comparing Calculi for first-order infinite-valued Łukasiewicz logic and first-order rational Pavelka logic
Authors:
The effect of temperature, humidity and dehydration on the formation of renal calculi.
Authors:
C L PRINCE
,
P Scardino
,
C T WOLAN
See all similar
Cited by
1
Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
Authors:
Oliver Garbe
,
Paweł Urzyczyn
,
Moritz Martens
…
See all cited by