Edizione	[1st ed. 2013.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica	1 online resource (XII, 251 p. 18 illus.)
Disciplina	005.131
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Computer science—Mathematics Computer science Artificial intelligence Mathematical logic Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Symbolic and Algebraic Manipulation Artificial Intelligence Mathematical Logic and Foundations
ISBN	3-642-38946-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNINA-9910483895403321

Edizione	[1st ed. 2011.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011
Descrizione fisica	1 online resource (XII, 245 p.)
Disciplina	005.131
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Computer science—Mathematics Computer science Artificial intelligence Mathematical logic Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Symbolic and Algebraic Manipulation Artificial Intelligence Mathematical Logic and Foundations
ISBN	3-642-21691-9
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Record Nr.	UNISA-996465539003316

Edizione	[1st ed. 2009.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica	1 online resource (XIII, 417 p.)
Disciplina	005.131
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Computer science—Mathematics Computer science Artificial intelligence Mathematical logic Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Symbolic and Algebraic Manipulation Artificial Intelligence Mathematical Logic and Foundations
ISBN	1-280-38300-3 9786613560919 3-642-02273-1
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Mathematical Synthesis of Equational Deduction Systems -- A Pronominal Approach to Binding and Computation -- A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance -- Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM 1 -- Syntax for Free: Representing Syntax with Binding Using Parametricity -- On the Meaning of Logical Completeness -- Thick Subtrees, Games and Experiments -- Bounded Linear Logic, Revisited -- Partial Orders, Event Structures and Linear Strategies -- Existential Type Systems with No Types in Terms -- Initial Algebra Semantics for Cyclic Sharing Structures -- An Operational Account of Call-by-Value Minimal and Classical ?-Calculus in “Natural Deduction” Form -- Refinement Types as Proof Irrelevance -- Weak ?-Categories from Intensional Type Theory -- Relating Classical Realizability and Negative Translation for Existential Witness Extraction -- Session-Based Communication Optimisation for Higher-Order Mobile Processes -- The Cut-Elimination Theorem for Differential Nets with Promotion -- A Polymorphic Type System for the Lambda-Calculus with Constructors -- Kripke Semantics for Martin-Löf’s Extensional Type Theory -- On the Values of Reducibility Candidates -- Lexicographic Path Induction -- Parametricity for Haskell with Imprecise Error Semantics -- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic -- Algebraic Totality, towards Completeness -- A Logical Foundation for Environment Classifiers -- Inhabitation of Low-Rank Intersection Types -- Differential Linear Logic and Polarization -- Complexity of Gödel’s T in ?-Formulation -- The Computational SLR: A Logic for Reasoning about Computational Indistinguishability.
Record Nr.	UNISA-996465858003316

Edizione	[1st ed. 2007.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica	1 online resource (404 p.)
Disciplina	511.35
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Computer science Computer programming Compilers (Computer programs) Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques Compilers and Interpreters
ISBN	1-280-95552-X 9786610955527 3-540-73228-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	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.
Record Nr.	UNISA-996466266003316

Edizione	[1st ed. 2005.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005
Descrizione fisica	1 online resource (XII, 436 p.)
Disciplina	511.3
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Machine theory Computer science Computer programming Compilers (Computer programs) Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques Compilers and Interpreters
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Completeness Theorems and ?-Calculus -- Completeness Theorems and ?-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-Löf’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 Calculus -- Rank-2 Intersection and Polymorphic Recursion -- Arithmetical Proofs of Strong Normalization Results for the Symmetric ??-Calculus -- Subtyping Recursive Types Modulo Associative Commutative Products -- Galois Embedding from Polymorphic Types into Existential Types -- On the Degeneracy of ?-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 ???-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 -Calculus. Functional Programming with Higher-Order Encodings -- A Lambda Calculus for Quantum Computation with Classical Control -- Continuity and Discontinuity in Lambda Calculus -- Call-by-Name and Call-by-Value as Token-Passing Interaction Nets -- Avoiding Equivariance in Alpha-Prolog -- Higher-Order Abstract Non-interference.
Record Nr.	UNISA-996465805503316