Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings / / edited by Christel Baier, Ugo Dal Lago
| Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings / / edited by Christel Baier, Ugo Dal Lago |
| Autore | Baier Christel |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XV, 583 p. 75 illus.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Artificial intelligence Electronic digital computers—Evaluation Computers Professions Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence System Performance and Evaluation The Computing Profession Discrete Mathematics in Computer Science |
| ISBN | 3-319-89366-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata. |
| Record Nr. | UNINA-9910293144603321 |
Baier Christel
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computation Structures [[electronic resource] ] : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings / / edited by Javier Esparza, Andrzej S. Murawski
| Foundations of Software Science and Computation Structures [[electronic resource] ] : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings / / edited by Javier Esparza, Andrzej S. Murawski |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 568 p. 59 illus.) |
| Disciplina | 005.1015113 |
| 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-54458-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coherence Spaces and Higher-Order Computation -- Coherence Spaces and Uniform Continuity -- The Free Exponential Modality of Probabilistic Coherence Spaces -- From Qualitative to Quantitative Semantics by Change of Base -- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra -- Algebra, coalgebra, and minimization in polynomial differential equations -- Equational Theories of Abnormal Termination Based on Kleene Algebra -- Companions, Codensity and Causality -- Nominal Automata with Name Binding -- Games and Automata -- On the existence of weak subgame perfect equilibria -- Optimal Reachability in Divergent Weighted Timed Games -- Bounding Average-energy Games -- Logics of repeating values on data trees and branching counter systems -- Automata, Logic and Formal Languages -- Degree of sequentiality of weighted automata -- Emptiness under isolation and the value problem for hierarchical probabilistic automata -- Partial Derivatives for Context-Free Languages -- Dynamic Complexity of the Dyck Reachability -- Proof Theory -- Cyclic Arithmetic is Equivalent to Peano Arithmetic -- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs -- Probability -- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context -- Computing continuous time Markov chains as transformers of unbounded observation functions -- Pointless Learning -- On Higher-Order Probabilistic Subrecursion. – Concurrency -- A Truly Concurrent Game Model of the Asynchronous ᴨ-Calculus -- Local Model Checking in a Logic for True Concurrency -- The Paths to Choreography Extraction -- On the Undecidability of Asynchronous Session Subtyping -- Lambda Calculus and Constructive Proof -- A Lambda-Free Higher-Order Recursive Path Order -- Automated Constructivization of Proofs -- Semantics and Category Theory -- A Light Modality for Recursion -- Unifying Guarded and Unguarded Iteration -- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type -- On the Semantics of Intensionality. |
| Record Nr. | UNISA-996466212803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures [[electronic resource] ] : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings / / edited by Javier Esparza, Andrzej S. Murawski
| Foundations of Software Science and Computation Structures [[electronic resource] ] : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings / / edited by Javier Esparza, Andrzej S. Murawski |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVII, 568 p. 59 illus.) |
| Disciplina | 005.1015113 |
| 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-54458-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Coherence Spaces and Higher-Order Computation -- Coherence Spaces and Uniform Continuity -- The Free Exponential Modality of Probabilistic Coherence Spaces -- From Qualitative to Quantitative Semantics by Change of Base -- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra -- Algebra, coalgebra, and minimization in polynomial differential equations -- Equational Theories of Abnormal Termination Based on Kleene Algebra -- Companions, Codensity and Causality -- Nominal Automata with Name Binding -- Games and Automata -- On the existence of weak subgame perfect equilibria -- Optimal Reachability in Divergent Weighted Timed Games -- Bounding Average-energy Games -- Logics of repeating values on data trees and branching counter systems -- Automata, Logic and Formal Languages -- Degree of sequentiality of weighted automata -- Emptiness under isolation and the value problem for hierarchical probabilistic automata -- Partial Derivatives for Context-Free Languages -- Dynamic Complexity of the Dyck Reachability -- Proof Theory -- Cyclic Arithmetic is Equivalent to Peano Arithmetic -- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs -- Probability -- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context -- Computing continuous time Markov chains as transformers of unbounded observation functions -- Pointless Learning -- On Higher-Order Probabilistic Subrecursion. – Concurrency -- A Truly Concurrent Game Model of the Asynchronous ᴨ-Calculus -- Local Model Checking in a Logic for True Concurrency -- The Paths to Choreography Extraction -- On the Undecidability of Asynchronous Session Subtyping -- Lambda Calculus and Constructive Proof -- A Lambda-Free Higher-Order Recursive Path Order -- Automated Constructivization of Proofs -- Semantics and Category Theory -- A Light Modality for Recursion -- Unifying Guarded and Unguarded Iteration -- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type -- On the Semantics of Intensionality. |
| Record Nr. | UNINA-9910483187203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computation Structures [[electronic resource] ] : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / / edited by Anca Muscholl
| Foundations of Software Science and Computation Structures [[electronic resource] ] : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / / edited by Anca Muscholl |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 457 p. 48 illus.) |
| Disciplina | 005.1015113 |
| 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-642-54830-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Equivalences of Pushdown Systems Are Hard -- Active Diagnosis for Probabilistic Systems -- Analysis of Probabilistic Basic Parallel Processes -- Limit Synchronization in Markov Decision Processes -- Maximal Cost-Bounded Reachability Probability on Continuous-Time -- Markov Decision Processes -- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types -- A Semantical and Operational Account of Call-by-Value Solvability -- Network-Formation Games with Regular Objectives -- Playing with Probabilities in Reconfigurable Broadcast Networks -- Unsafe Order-2 Tree Languages Are Context-Sensitive -- Game Semantics for Nominal Exceptions -- Complexity of Model-Checking Call-by-Value Programs -- Resource Reachability Games on Pushdown Graphs -- Perfect-Information Stochastic Mean-Payoff Parity Games -- Latticed-LTL Synthesis in the Presence of Noisy Inputs -- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies -- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations -- On Asymmetric Unification and the Combination Problem in Disjoint Theories -- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules -- Generalized Synchronization Trees -- Bisimulations for Communicating Transactions -- Upper-Expectation Bisimilarity and Lukasiewicz μ-Calculus -- Interacting Bialgebras Are Frobenius -- Generalized Eilenberg Theorem I: Local Varieties of Languages -- Combining Bialgebraic Semantics and Equations -- Models of a Non-associative Composition -- Foundations for Decision Problems in Separation Logic with General Inductive Predicates -- A Coalgebraic Approach to Linear-Time Logics -- A Relatively Complete Calculus for Structured Heterogeneous Specifications. |
| Record Nr. | UNISA-996203270003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / / edited by Anca Muscholl
| Foundations of Software Science and Computation Structures : 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / / edited by Anca Muscholl |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 457 p. 48 illus.) |
| Disciplina | 005.1015113 |
| 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-642-54830-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Equivalences of Pushdown Systems Are Hard -- Active Diagnosis for Probabilistic Systems -- Analysis of Probabilistic Basic Parallel Processes -- Limit Synchronization in Markov Decision Processes -- Maximal Cost-Bounded Reachability Probability on Continuous-Time -- Markov Decision Processes -- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types -- A Semantical and Operational Account of Call-by-Value Solvability -- Network-Formation Games with Regular Objectives -- Playing with Probabilities in Reconfigurable Broadcast Networks -- Unsafe Order-2 Tree Languages Are Context-Sensitive -- Game Semantics for Nominal Exceptions -- Complexity of Model-Checking Call-by-Value Programs -- Resource Reachability Games on Pushdown Graphs -- Perfect-Information Stochastic Mean-Payoff Parity Games -- Latticed-LTL Synthesis in the Presence of Noisy Inputs -- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies -- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations -- On Asymmetric Unification and the Combination Problem in Disjoint Theories -- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules -- Generalized Synchronization Trees -- Bisimulations for Communicating Transactions -- Upper-Expectation Bisimilarity and Lukasiewicz μ-Calculus -- Interacting Bialgebras Are Frobenius -- Generalized Eilenberg Theorem I: Local Varieties of Languages -- Combining Bialgebraic Semantics and Equations -- Models of a Non-associative Composition -- Foundations for Decision Problems in Separation Logic with General Inductive Predicates -- A Coalgebraic Approach to Linear-Time Logics -- A Relatively Complete Calculus for Structured Heterogeneous Specifications. |
| Record Nr. | UNINA-9910484912403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computational Structures [[electronic resource] ] : 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 / / edited by Vladimiro Sassone
| Foundations of Software Science and Computational Structures [[electronic resource] ] : 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 / / edited by Vladimiro Sassone |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 530 p.) |
| Disciplina | 005.1015113 |
| 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 Theory of Computation Compilers and Interpreters Software Engineering |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Model Checking for Nominal Calculi -- Mathematical Models of Computational and Combinatorial Structures -- Rule Formats and Bisimulation -- Congruence for Structural Congruences -- Probabilistic Congruence for Semistochastic Generative Processes -- Bisimulation on Speed: A Unified Approach -- Probabilistic Models -- Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications -- Axiomatizations for Probabilistic Finite-State Behaviors -- Stochastic Transition Systems for Continuous State Spaces and Non-determinism -- Model Checking Durational Probabilistic Systems -- Algebraic Models -- Free-Algebra Models for the ?-Calculus -- A Unifying Model of Variables and Names -- A Category of Higher-Dimensional Automata -- Games and Automata -- Third-Order Idealized Algol with Iteration Is Decidable -- Fault Diagnosis Using Timed Automata -- Optimal Conditional Reachability for Multi-priced Timed Automata -- Alternating Timed Automata -- Language Analysis -- Full Abstraction for Polymorphic Pi-Calculus -- Foundations of Web Transactions -- Bridging Language-Based and Process Calculi Security -- History-Based Access Control with Local Policies -- Partial Order Models -- Composition and Decomposition in True-Concurrency -- Component Refinement and CSC Solving for STG Decomposition -- The Complexity of Live Sequence Charts -- Logics -- A Simpler Proof Theory for Nominal Logic -- From Separation Logic to First-Order Logic -- Justifying Algorithms for ??-Conversion -- On Decidability Within the Arithmetic of Addition and Divisibility -- Coalgebraic Modal Logics -- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond -- Duality for Logics of Transition Systems -- Computational Models -- Confluence of Right Ground Term Rewriting Systems Is Decidable -- Safety Is not a Restriction at Level 2 for String Languages -- A Computational Model for Multi-variable Differential Calculus. |
| Record Nr. | UNISA-996465678103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computational Structures : 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 / / edited by Vladimiro Sassone
| Foundations of Software Science and Computational Structures : 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005 / / edited by Vladimiro Sassone |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 530 p.) |
| Disciplina | 005.1015113 |
| 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 Theory of Computation Compilers and Interpreters Software Engineering |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Model Checking for Nominal Calculi -- Mathematical Models of Computational and Combinatorial Structures -- Rule Formats and Bisimulation -- Congruence for Structural Congruences -- Probabilistic Congruence for Semistochastic Generative Processes -- Bisimulation on Speed: A Unified Approach -- Probabilistic Models -- Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications -- Axiomatizations for Probabilistic Finite-State Behaviors -- Stochastic Transition Systems for Continuous State Spaces and Non-determinism -- Model Checking Durational Probabilistic Systems -- Algebraic Models -- Free-Algebra Models for the ?-Calculus -- A Unifying Model of Variables and Names -- A Category of Higher-Dimensional Automata -- Games and Automata -- Third-Order Idealized Algol with Iteration Is Decidable -- Fault Diagnosis Using Timed Automata -- Optimal Conditional Reachability for Multi-priced Timed Automata -- Alternating Timed Automata -- Language Analysis -- Full Abstraction for Polymorphic Pi-Calculus -- Foundations of Web Transactions -- Bridging Language-Based and Process Calculi Security -- History-Based Access Control with Local Policies -- Partial Order Models -- Composition and Decomposition in True-Concurrency -- Component Refinement and CSC Solving for STG Decomposition -- The Complexity of Live Sequence Charts -- Logics -- A Simpler Proof Theory for Nominal Logic -- From Separation Logic to First-Order Logic -- Justifying Algorithms for ??-Conversion -- On Decidability Within the Arithmetic of Addition and Divisibility -- Coalgebraic Modal Logics -- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond -- Duality for Logics of Transition Systems -- Computational Models -- Confluence of Right Ground Term Rewriting Systems Is Decidable -- Safety Is not a Restriction at Level 2 for String Languages -- A Computational Model for Multi-variable Differential Calculus. |
| Record Nr. | UNINA-9910484869003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
From Logic Design to Logic Programming [[electronic resource] ] : Theorem Proving Techniques and P-Functions / / by Dominique Snyers, Andre Thayse
| From Logic Design to Logic Programming [[electronic resource] ] : Theorem Proving Techniques and P-Functions / / by Dominique Snyers, Andre Thayse |
| Autore | Snyers Dominique |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (IV, 125 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-47811-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theorem in proving and P-functions -- Grammars, logics and declarative programming -- Grammars and Semantics. |
| Record Nr. | UNISA-996465832903316 |
|
Snyers Dominique
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Functional and Constraint Logic Programming [[electronic resource] ] : 20th International Workshop, WFLP 2011, Odense, Denmark, July 19, 2011, Proceedings / / edited by Herbert Kuchen
| Functional and Constraint Logic Programming [[electronic resource] ] : 20th International Workshop, WFLP 2011, Odense, Denmark, July 19, 2011, Proceedings / / edited by Herbert Kuchen |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (VII, 157 p.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Artificial intelligence Computer science—Mathematics Image processing—Digital techniques Computer vision Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Artificial Intelligence Symbolic and Algebraic Manipulation Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-22531-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465950403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Functional and Constraint Logic Programming [[electronic resource] ] : 19th International Workshop, WFLP 2010, Madrid, Spain, January 17, 2010. Revised Selected Papers / / edited by Julio Marino
| Functional and Constraint Logic Programming [[electronic resource] ] : 19th International Workshop, WFLP 2010, Madrid, Spain, January 17, 2010. Revised Selected Papers / / edited by Julio Marino |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (IX, 175 p.) |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Artificial intelligence Computer science—Mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Artificial Intelligence Symbolic and Algebraic Manipulation |
| ISBN | 3-642-20775-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465373603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
