Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (700 p. 51 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
ISBN | 3-642-31585-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465569603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automata, Languages, and Programming [[electronic resource] ] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I / / edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (860 p. 64 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
ISBN | 3-642-31594-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465566203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Category Theory and Computer Science [[electronic resource] ] : Paris, France, September 3-6, 1991. Proceedings / / edited by David H. Pitt, Pierre-Louis Curien, Samson Abramsky, Andrew Pitts, Axel Poigne, David E. Rydeheard |
Edizione | [1st ed. 1991.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
Descrizione fisica | 1 online resource (VIII, 304 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematics
Computers Computer logic Mathematical logic Programming languages (Electronic computers) Software engineering Mathematics, general Theory of Computation Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Languages, Compilers, Interpreters Software Engineering |
ISBN | 3-540-38413-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Stone duality for stable functions -- Bifinite domains: Stable case -- Local variables and non-interference in algol-like languages -- Categories of information systems -- Collapsing graph models by preorders -- Linear logic and interference control -- Higher dimensional word problem -- BCK-formulas having unique proofs -- Proof nets and coherence theorems -- A modular approach to denotational semantics -- Programs in partial algebras — A categorical approach -- Tail recursion from universal invariants -- A direct proof of the intuitionistic Ramsey Theorem -- Constructions and predicates -- Relating models of impredicative type theories -- Two results on set-theoretic polymorphism -- An algebra of graphs and graph rewriting -- Dataflow networks are fibrations -- Applications of the calculus of trees to process description languages. |
Record Nr. | UNISA-996465660003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Category Theory and Computer Science [[electronic resource] ] : Manchester, UK, September 5-8, 1989. Proceedings / / edited by David H. Pitt, David E. Rydeheard, Peter Dybjer, Andrew Pitts, Axel Poigne |
Edizione | [1st ed. 1989.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
Descrizione fisica | 1 online resource (VIII, 372 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Computer logic Mathematical logic Programming languages (Electronic computers) Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Languages, Compilers, Interpreters Mathematical Logic and Foundations |
ISBN | 3-540-46740-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Coherence and valid isomorphism in closed categories applications of proof theory to category theory in a computer sclentist perspective -- An algebraic view of interleaving and distributed operational semantics for CCS -- Temporal structures -- Compositional relational semantics for indeterminate dataflow networks -- Operations on records -- Projections for polymorphic strictness analysis -- A category-theoretic account of program modules -- A note on categorical datatypes -- A set constructor for inductive sets in Martin-Löf's type theory -- Independence results for calculi of dependent types -- Quantitative domains, groupoids and linear logic -- Graded multicategories of polynomial-time realizers -- On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa -- Dictoses -- Declarative continuations: An investigation of duality in programming language semantics -- Logic representation in LF -- Unification properties of commutative theories: A categorical treatment -- An abstract formulation for rewrite systems -- From petri nets to linear logic -- A dialectica-like model of linear logic -- A final coalgebra theorem. |
Record Nr. | UNISA-996465729003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Foundations of Software Science and Computation Structures [[electronic resource] ] : 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings / / edited by Andrew Pitts |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XVI, 465 p. 92 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Software Engineering Theory of Computation |
ISBN | 3-662-46678-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic. |
Record Nr. | UNISA-996200342503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Foundations of Software Science and Computation Structures : 18th International Conference, FOSSACS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings / / edited by Andrew Pitts |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (XVI, 465 p. 92 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Software Engineering Theory of Computation |
ISBN | 3-662-46678-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Polarized Substructural Session Types -- Semantics of Programming Languages I -- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism -- An Infinitary Model of Linear Logic -- Game Semantics and Normalization by Evaluation -- Foundations of Differential Dataflow -- Categorical Models and Logics -- States of Convex Sets -- A Categorical Semantics for Linear Logical Frameworks -- A Completeness Result for Finite λ-bisimulations -- Sequent Calculus in the Topos of Trees -- Modal and Temporal Logics -- Coalgebraic Trace Semantics via Forgetful Logics -- Unifying Hyper and Epistemic Temporal Logics -- Concurrent, Probabilistic and Timed Systems On the Total Variation Distance of Semi-Markov Chains -- Decidable and Expressive Classes of Probabilistic Automata -- Knowledge = Observation + Memory + Computation -- Compositional Metric Reasoning with Probabilistic Process Calculi -- Semantics of Programming Languages II -- Fragments of ML Decidable by Nested Data Class Memory Automata -- Operational Nominal Game Semantics -- Step-Indexed Logical Relations for Probability -- Automata, Games, Verification -- Minimisation of Multiplicity Tree Automata -- Robust Multidimensional Mean-Payoff Games are Undecidable -- The Cyclic-Routing UAV Problem Is PSPACE-Complete -- Typing Weak MSOL Properties -- Logical Aspects of Computational Complexity Three Variables Suffice for Real-Time Logic -- On Presburger Arithmetic Extended with Modulo Counting Quantifiers -- Parity Games of Bounded Tree- and Clique-Width -- Type Theory, Proof Theory and Implicit Computational Complexity -- Programming and Reasoning with Guarded Recursion for Coinductive Types -- The Computational Contents of Ramified Corecurrence -- On the Dependencies of Logical Rules -- On the Mints Hierarchy in First-Order Intuitionistic Logic. |
Record Nr. | UNINA-9910484566303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2015 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|