|
|
Sold Out
Book Categories |
| Completeness theorems and [lambda]-calculus | 1 | |
| A tutorial example of the semantic approach to foundational proof-carrying code : abstract | 10 | |
| Can proofs be animated by games? | 11 | |
| Untyped algorithmic equality for Martin-Lof's logical framework with surjective pairs | 23 | |
| The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable | 39 | |
| A feasible algorithm for typing in elementary affine logic | 55 | |
| Practical inference for type-based termination in a polymorphic setting | 71 | |
| Relational reasoning in a nominal semantics for storage | 86 | |
| Filters on coinductive streams, an application to Eratosthenes' sieve | 102 | |
| Recursive functions with higher order domains | 116 | |
| Elementary affine logic and the call-by-value lambda calculus | 131 | |
| Rank-2 intersection and polymorphic recursion | 146 | |
| Arithmetical proofs of strong normalization results for the symmetric [lambda][mu]-calculus | 162 | |
| Subtyping recursive types modulo associative commutative products | 179 | |
| Galois embedding from polymorphic types into existential types | 194 | |
| On the degeneracy of [Sigma]-types in presence of computational classical logic | 209 | |
| Semantic cut elimination in the intuitionistic sequent calculus | 221 | |
| The elimination of nesting in SPCF | 234 | |
| Naming proofs in classical propositional logic | 246 | |
| Reducibility and [tau][tau]-lifting for computation types | 262 | |
| Privacy in data mining using formal methods | 278 | |
| L[superscript 3] : a linear language with locations | 293 | |
| Binding signatures for generic contexts | 308 | |
| Proof contexts with late binding | 324 | |
| The [actual symbol not reproducible]-calculus : functional programming with higher-order encodings | 339 | |
| A lambda calculus for quantum computation with classical control | 354 | |
| Continuity and discontinuity in lambda calculus | 369 | |
| Call-by-name and call-by-value as token-passing interaction nets | 386 | |
| Avoiding equivariance in alpha-prolog | 401 | |
| Higher-order abstract non-interference | 417 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Uyfgo Perez
reviewed Typed Lambda Calculi and Applications on April 22, 2009
Typed Lambda Calculi and Applications
Too terse for my taste. The proofs are too telegraphic, probably with the intention of treating a large number of theorems / results. It's an excellent compendium (a lot of new material) but it's not a book to learn Graph Theory from.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Typed Lambda Calculi and Applications
X
This Item is in Your Inventory
Typed Lambda Calculi and Applications
X
You must be logged in to review the productsX
X
X
Add Typed Lambda Calculi and Applications, This book constitutes the refereed proceedings of the 7th International Conference on Typed Lambda Calculi and Applications, TLCA 2005, held in Nara, Japan in April 2005. The 27 revised full papers presented together with 2 invited papers were carefull, Typed Lambda Calculi and Applications to the inventory that you are selling on WonderClubX
X
Add Typed Lambda Calculi and Applications, This book constitutes the refereed proceedings of the 7th International Conference on Typed Lambda Calculi and Applications, TLCA 2005, held in Nara, Japan in April 2005. The 27 revised full papers presented together with 2 invited papers were carefull, Typed Lambda Calculi and Applications to your collection on WonderClub |
