Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XXIV, 614 p. 78 illus.) |
Disciplina | 005.11 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science Programming Techniques Computer Communication Networks Software Engineering Theory of Computation |
ISBN |
1-280-38771-8
9786613565631 3-642-14162-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. |
Record Nr. | UNISA-996465841903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XXIII, 754 p. 42 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Computer programming Computer networks Algorithms Artificial intelligence Computer science Software Engineering Programming Techniques Computer Communication Networks Artificial Intelligence Theory of Computation |
ISBN |
1-280-38772-6
9786613565648 3-642-14165-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. |
Record Nr. | UNISA-996465839903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part I / / Samson Abramsky ... [et al.], (eds.) |
Edizione | [1st ed.] |
Pubbl/distr/stampa | Berlin, : Springer, 2010 |
Descrizione fisica | 1 online resource (XXIII, 754 p. 42 illus.) |
Disciplina | 005.1 |
Altri autori (Persone) | AbramskySamson |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues Advanced research in computing and software science |
Soggetto topico |
Machine theory
Computer programming Robots - Programming Formal languages |
ISBN |
1-280-38772-6
9786613565648 3-642-14165-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. |
Record Nr. | UNINA-9910484310003321 |
Berlin, : Springer, 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automata, languages and programming : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings. Part II / / Samson Abramsky ... [et al.], (eds.) |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, : Springer, 2010 |
Descrizione fisica | 1 online resource (XXIV, 614 p. 78 illus.) |
Disciplina | 005.11 |
Altri autori (Persone) | AbramskySamson |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico |
Machine theory
Formal languages Computer programming |
ISBN |
1-280-38771-8
9786613565631 3-642-14162-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. |
Record Nr. | UNINA-9910484309903321 |
Berlin, : Springer, 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Category Theory and Computer Programming [[electronic resource] ] : Tutorial and Workshop, Guildford, U.K., September 16 - 20, 1985. Proceedings / / edited by David Pitt, Samson Abramsky, Axel Poigne, David Rydeheard |
Edizione | [1st ed. 1986.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
Descrizione fisica | 1 online resource (X, 522 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Computer programming Logics and Meanings of Programs Programming Techniques |
ISBN | 3-540-47213-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Categories -- Elements of categorical reasoning : Products and coproducts and some other (co-)limits -- Functors and natural transformations -- Adjunctions -- Cartesian closure — Higher types in categories -- Algebra categorically -- Category theory and logic -- Categories, data types, and imperative languages -- Category theory and programming language semantics: An overview -- Weakest preconditions: Categorical insights -- A categorical view of weakest liberal preconditions -- Functor-category semantics of programming languages and logics -- Finite approximation of spaces -- Categories of partial morphisms and the ?P-calculus -- A note on distributive laws and power domains -- Category theory and models for parallel computation -- Categorical models of process cooperation -- Galois connections and computer science applications -- A study in the foundations of programming methodology: Specifications, institutions, charters and parchments -- Bits and pieces of the theory of institutions -- Extended ML: An institution-independent framework for formal program development -- Behavioural program specification -- Key extensions of abstract data types, final algebras, and database semantics -- Theories as categories -- Internal completeness of categories of domains -- Formalising the network and hierarchical data models — an application of categorical Logic -- A categorical unification algorithm -- Computing with categories. |
Record Nr. | UNISA-996465967403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
![]() | ||
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 | ||
|
Dependence logic : theory and applications / / edited by Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 |
Descrizione fisica | 1 online resource (286 p.) |
Disciplina | 510 |
Soggetto topico |
Mathematical logic
Logic Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
ISBN | 3-319-31803-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Durand, Kontinen, Vollmer, Expressivity and Complexity of Dependence Logic -- Väänänen, Grelling on Dependence -- Galliani, On Strongly First-Order Dependencies -- Grädel, Games for Inclusion Logic and Fixed-Point Logic -- Hodges, Remarks on Compositionality -- Hirvonen, Independence in Model Theory -- Ciardelli, Dependency as Question Entailment -- Link, Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data -- Nyman, Pensar, Corander, Context-Specific and Local Independence in Markovian Dependence Structures -- Pacuit, Fang, Dependence and Independence in Social Choice: Arrow's Theorem -- Blass, Introduction to Secret-Sharing. |
Record Nr. | UNINA-9910254098003321 |
Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Typed Lambda Calculi and Applications [[electronic resource] ] : 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings / / edited by Samson Abramsky |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (XII, 436 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical analysis
Analysis (Mathematics) Mathematical logic Computer logic Computer programming Programming languages (Electronic computers) Analysis Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques Programming Languages, Compilers, Interpreters |
ISBN | 3-540-45413-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic ?-Calculus -- Sequentiality and the ?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy ?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the ?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot’s Second Order ??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the ?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of ?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. |
Record Nr. | UNISA-996466072803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Typed Lambda Calculi and Applications : 5th International Conference, TLCA 2001 Krakow, Poland, May 2-5, 2001 Proceedings / / edited by Samson Abramsky |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (XII, 436 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical analysis
Analysis (Mathematics) Mathematical logic Computer logic Computer programming Programming languages (Electronic computers) Analysis Mathematical Logic and Foundations Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques Programming Languages, Compilers, Interpreters |
ISBN | 3-540-45413-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- Many Happy Re urns -- From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour -- Definability of Total Objects in PCF and Related Calculi -- Categorical Semantics of Control -- Contributed Papers -- Representations of First Order Function Types as Terminal Coalgebras -- A Finitary Subsystem of the Polymorphic ?-Calculus -- Sequentiality and the ?-Calculus -- Logical Properites of Name Restriction -- Subtyping Recursive Games -- Typing Lambda Terms in Elementary Logic with Linear Constraints -- Ramied Recurrence with Dependent Types -- Game Semantics for the Pure Lazy ?-Calculus -- Reductions, intersection types, and explicit substitutions -- The Stratified Foundations as a Theory Modulo -- Normalization by Evaluation for the Computational Lambda-Calculus -- Induction Is Not Derivable in Second Order Dependent Type Theory -- Strong Normalization of Classical Natural Deduction with Disjunction -- Partially Additive Categories and Fully Complete Models of Linear Logic -- Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types -- The Finitely Generated Types of the ?-Calculus -- Deciding Monadic Theories of Hyperalgebraic Trees -- A Deconstruction of Non-deterministic Classical Cut Elimination -- A Token Machine for Full Geometry of Interaction (Extended Abstract) -- Second-Order Pre-logical Relations and Representation Independence -- Characterizing Convergent Terms in Object Calculi via Intersection Types -- Parigot’s Second Order ??-Calculus and Inductive Types -- The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping -- Evolving Games and Essential Nets for Affine Polymorphism -- Retracts in Simple Types -- Parallel Implementation Models for the ?-Calculus Using the Geometry of Interaction (Extended Abstract) -- The complexity of ?-reduction in low orders -- Strong Normalisation for a Gentzen-like Cut-Elimination Procedure. |
Record Nr. | UNINA-9910143596803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|