| Completeness Theorems and A-Calculus A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract Can Proofs Be Animated by Games? Contributed Papers Untyped Algorithmic Equality for Martin-LSf's Logical Framework with Surjective Pairs The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable A Feasible Algorithm for Typing in Elementary Affine Logic Practical Inference for Type-Based Termination in a Polymorphic Setting Relational Reasoning in a Nominal Semantics for Storage Filters on CoInductive Streams, an Application to Eratosthenes' Sieve Recursive Functions with Higher Order Domains Elementary Affine Logic and the Call-by-Value Lambda CalculusRank-2 Intersection and Polymorphic Recursion Aft-Calculus Subtyping Recursive Types Modulo Associative Commutative Products Galois Embedding from Polymorphic Types into Existential Types On the Degeneracy of Z-Types in Presence of Computational Classical Logic Semantic Cut Elimination in the Intuitionistic Sequent Calculus The Elimination of Nesting in SPCF Naming Proofs in Classical Propositional Logic Reducibility and TT-Lifting for Computation Types Privacy in Data Mining Using Formal Methods L3: A Linear Language with Locations Binding Signatures for Generic Contexts Proof Contexts with Late Binding The V-Calculus. Functional Programming with Higher-Order Encodings A Lambda Calculus for Quantum Computation with Classical Control Continuity and Discontinuity in Lambda Calculus Author Index |
内容加载中，请稍后...
商品评论（0条）