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.
Algebra, Meaning, and Computation [[electronic resource] ] : Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday / / edited by Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer
| Algebra, Meaning, and Computation [[electronic resource] ] : Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday / / edited by Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XXXVIII, 650 p.) |
| Disciplina | 512 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Computer science—Mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Theory of Computation Mathematics of Computing |
| ISBN | 3-540-35464-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Meaning -- Sync or Swarm: Musical Improvisation and the Complex Dynamics of Group Creativity -- My Friend Joseph Goguen -- Metalogic, Qualia, and Identity on Neptune’s Great Moon: Meaning and Mathematics in the Works of Joseph A. Goguen and Samuel R. Delany -- Meta-Logic -- Quantum Institutions -- Jewels of Institution-Independent Model Theory -- Semantic Web Languages – Towards an Institutional Perspective -- Institutional 2-cells and Grothendieck Institutions -- Some Varieties of Equational Logic -- Complete Categorical Deduction for Satisfaction as Injectivity -- Specification and Composition -- Extension Morphisms for CommUnity -- Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application -- From OBJ to ML to Coq -- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations -- From OBJ to Maude and Beyond -- Constructive Action Semantics in OBJ -- Horizontal Composability Revisited -- Composition by Colimit and Formal Software Development -- Behaviour and Formal Languages -- Proving Behavioral Refinements of COL-specifications -- The Reactive Engine for Modular Transducers -- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages -- Sheaves and Structures of Transition Systems -- Uniform Functors on Sets -- An Algebraic Approach to Regular Sets -- Models, Deduction, and Computation -- Elementary Algebraic Specifications of the Rational Complex Numbers -- From Chaos to Undefinedness -- Completion Is an Instance of Abstract Canonical System Inference -- Eliminating Dependent Pattern Matching -- Iterative Lexicographic Path Orders -- A Functorial Framework for Constraint Normal Logic Programming -- A Stochastic Theory of Black-Box Software Testing -- Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method -- Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. |
| Record Nr. | UNISA-996465756003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebra, Meaning, and Computation [[electronic resource] ] : Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday / / edited by Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer
| Algebra, Meaning, and Computation [[electronic resource] ] : Essays dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday / / edited by Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XXXVIII, 650 p.) |
| Disciplina | 512 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Artificial intelligence Computer science—Mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Theory of Computation Mathematics of Computing |
| ISBN | 3-540-35464-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Meaning -- Sync or Swarm: Musical Improvisation and the Complex Dynamics of Group Creativity -- My Friend Joseph Goguen -- Metalogic, Qualia, and Identity on Neptune’s Great Moon: Meaning and Mathematics in the Works of Joseph A. Goguen and Samuel R. Delany -- Meta-Logic -- Quantum Institutions -- Jewels of Institution-Independent Model Theory -- Semantic Web Languages – Towards an Institutional Perspective -- Institutional 2-cells and Grothendieck Institutions -- Some Varieties of Equational Logic -- Complete Categorical Deduction for Satisfaction as Injectivity -- Specification and Composition -- Extension Morphisms for CommUnity -- Non-intrusive Formal Methods and Strategic Rewriting for a Chemical Application -- From OBJ to ML to Coq -- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations -- From OBJ to Maude and Beyond -- Constructive Action Semantics in OBJ -- Horizontal Composability Revisited -- Composition by Colimit and Formal Software Development -- Behaviour and Formal Languages -- Proving Behavioral Refinements of COL-specifications -- The Reactive Engine for Modular Transducers -- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages -- Sheaves and Structures of Transition Systems -- Uniform Functors on Sets -- An Algebraic Approach to Regular Sets -- Models, Deduction, and Computation -- Elementary Algebraic Specifications of the Rational Complex Numbers -- From Chaos to Undefinedness -- Completion Is an Instance of Abstract Canonical System Inference -- Eliminating Dependent Pattern Matching -- Iterative Lexicographic Path Orders -- A Functorial Framework for Constraint Normal Logic Programming -- A Stochastic Theory of Black-Box Software Testing -- Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method -- Drug Interaction Ontology (DIO) and the Resource-Sensitive Logical Inferences. |
| Record Nr. | UNINA-9910484787503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Certified Programs and Proofs [[electronic resource] ] : First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011, Proceedings / / edited by Jean-Pierre Jouannaud, Zhong Shao
| Certified Programs and Proofs [[electronic resource] ] : First International Conference, CPP 2011, Kenting, Taiwan, December 7-9, 2011, Proceedings / / edited by Jean-Pierre Jouannaud, Zhong Shao |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XV, 401 p. 87 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Computer science—Mathematics Software engineering Artificial intelligence Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Symbolic and Algebraic Manipulation Software Engineering Artificial Intelligence |
| ISBN | 3-642-25379-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465684403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Conditional Term Rewriting Systems [[electronic resource] ] : 1st International Workshop Orsay, France, July 8-10, 1987. Proceedings / / edited by Stephane Kaplan, Jean-Pierre Jouannaud
| Conditional Term Rewriting Systems [[electronic resource] ] : 1st International Workshop Orsay, France, July 8-10, 1987. Proceedings / / edited by Stephane Kaplan, Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages |
| ISBN | 3-540-39166-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semantics for Prolog via term rewrite systems -- Hierarchical contextual rewriting with several levels -- Confluence of conditional rewrite systems -- Solving goals in equational languages -- On the use of conditional rewrite rules in inductive theorem proving -- A completion procedure for conditional equations -- A compiler for a class of conditional term rewriting systems -- Notes on the elimination of conditions -- Equational axiomatizations of if-then-else -- Compiling conditional rewriting systems -- Positive/negative conditional rewriting -- On word problems in Horn theories -- Conditional specifications with inequational assumptions -- A logical analysis on theory of conditional rewriting -- Computing with conditional rewrite rules -- A logic for conditional term rewriting systems -- Confluent term rewriting systems with membership conditions -- TRSPEC: A term rewriting based system for algebraic specifications -- CEC: A system for the completion of conditional equational specifications -- Asspegique -- REVEUR4: A laboratory for conditional rewriting -- An introduction to OBJ 3 -- The Passau RAP system: Rapid prototyping for algebraic specifications -- Architecture for conditional term rewriting. |
| Record Nr. | UNISA-996465686603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Constraints in Computational Logics [[electronic resource] ] : First International Conference, CCL '94, Munich, Germany, September 7 - 9, 1994. Proceedings / / edited by Jean-Pierre Jouannaud
| Constraints in Computational Logics [[electronic resource] ] : First International Conference, CCL '94, Munich, Germany, September 7 - 9, 1994. Proceedings / / edited by Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 371 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Computers Computer logic Artificial intelligence Computer programming Mathematical Logic and Formal Languages Theory of Computation Mathematical Logic and Foundations Logics and Meanings of Programs Artificial Intelligence Programming Techniques |
| ISBN | 3-540-48699-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Automated deduction with constraints -- Local simplification -- Simplifying clausal satisfiability problems -- Ordered Binary Decision Diagrams and the Davis-Putnam procedure -- A foundation for higher-order concurrent constraint programming -- Constraints for polymorphic behaviours of concurrent ML -- A confluent relational calculus for higher-order programming with constraints -- Modular AC unification of higher-order patterns -- Higher order disunification: Some decidable cases -- “Syntactic” AC-unification -- Applications of constraint logic programming -- Repeated redundant inequalities in constraint logic programming -- An efficient algorithm of logic programming with constraint hierarchy -- Application of constraint logic programming for VLSI CAD tools -- Path consistency in clp(FD) -- Symbolic constraints and tree automata -- A record calculus with principal types -- ECOLOG: an Environment for constraint logics -- On modularity in term rewriting and narrowing -- Higher order conditional rewriting and narrowing -- Buchberger's algorithm: A constraint-based completion procedure -- Set constraints and logic programming -- Set constraints in some equational theories -- How to win a game with features -- Some new decidability results on positive and negative set constraints -- Solving simplification ordering constraints. |
| Record Nr. | UNISA-996466115403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Functional Programming Languages and Computer Architecture [[electronic resource] ] : Proceedings, Nancy, France, September 16-19, 1985 / / edited by Jean-Pierre Jouannaud
| Functional Programming Languages and Computer Architecture [[electronic resource] ] : Proceedings, Nancy, France, September 16-19, 1985 / / edited by Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1985.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 |
| Descrizione fisica | 1 online resource (VIII, 416 p.) |
| Disciplina | 004.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Microprocessors
Processor Architectures |
| ISBN | 3-540-39677-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Miranda: A non-strict functional language with polymorphic types -- Data flow graph optimization in if1 -- Strictness analysis — a practical approach -- The categorical abstract machine -- High order programming in extended FP -- Secd-m: a virtual machine for applicative programming -- Cobweb — A combinator reduction architecture -- How to replace failure by a list of successes a method for exception handling, backtracking, and pattern matching in lazy functional languages -- Lazy memo-functions -- An architecture for fast data movement in the FFP machine -- An architecture that efficiently updates associative aggregates in applicative programming languages -- Lambda lifting: Transforming programs to recursive equations -- Optimizing almost-tail-recursive prolog programs -- Designing regular array architectures using higher ordertions -- vFP : An environment for the multi-level specification, analysis, and synthesis of hardware algorithms -- A distributed garbage collection algorithm -- Cyclic reference counting for combinator machines -- Design for a multiprocessing heap with on-board reference counting -- A functional language and modular architecture for scientific computing -- Practical polymorphism -- Program verification in a logical theory of constructions -- Transforming recursive programs for execution on parallel machines -- Compiling pattern matching -- Serial combinators: "optimal" grains of parallelism -- The G-machine: A fast, graph-reduction evaluator. |
| Record Nr. | UNISA-996466144203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Rewriting Techniques and Applications [[electronic resource] ] : Dijon, France, May 20-22, 1985 / / edited by Jean-Pierre Jouannaud
| Rewriting Techniques and Applications [[electronic resource] ] : Dijon, France, May 20-22, 1985 / / edited by Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1985.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 |
| Descrizione fisica | 1 online resource (VIII, 444 p.) |
| Disciplina | 005.131 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages |
| ISBN | 3-540-39679-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic features and development of the critical-pair/completion procedure -- Contextual rewriting -- Thue systems as rewriting systems -- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems -- Two applications of equational theories to database theory -- An experiment in partial evaluation: The generation of a compiler generator -- NARROWER: a new algorithm for unification and its application to Logic Programming -- Solving type equations by graph rewriting -- Termination -- Path of subterms ordering and recursive decomposition ordering revisited -- Associative path orderings -- A procedure for automatically proving the termination of a set of rewrite rules -- Petrireve: Proving Petri net properties with rewriting systems -- Fairness in term rewriting systems -- Two results in term rewriting theorem proving -- Handling function definitions through innermost superposition and rewriting -- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras -- Combining unification algorithms for confined regular equational theories -- An algebraic approach to unification under associativity and commutativity -- Unification problems with one-sided distributivity -- Fast many-to-one matching algorithms -- Complexity of matching problems -- The set of unifiers in typed ?-calculus as regular expression -- Equational systems for category theory and intuitionistic logic. |
| Record Nr. | UNISA-996466146403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1985 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
TAPSOFT '93: Theory and Practice of Software Development [[electronic resource] ] : 4th International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993. Proceedings / / edited by Marie-Claude Gaudel, Jean-Pierre Jouannaud
| TAPSOFT '93: Theory and Practice of Software Development [[electronic resource] ] : 4th International Joint Conference CAAP/FASE, Orsay, France, April 13-17, 1993. Proceedings / / edited by Marie-Claude Gaudel, Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (XII, 768 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Computers Algorithms Software Engineering/Programming and Operating Systems Programming Techniques Software Engineering Programming Languages, Compilers, Interpreters Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-47598-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Goldilocks and the three specifications -- On relating some models for concurrency -- Compositionality results for different types of parameterization and parameter passing in specification languages -- Proving ground confluence and inductive validity in constructor based equational specifications -- Associative-commutative discrimination nets -- Algebraic specification and development in geometric modeling -- A case study in transformational design of concurrent systems -- Yeast: A case study for a practical use of formal methods -- Verification and comparison of transition systems -- Constraining interference in an object-based design method -- From ?-calculus to higher-order ?-calculus — and back -- Hyperedge replacement with rendezvous -- True concurrency semantics for a linear logic programming language with broadcast communication -- A general framework for modular implementations of modular system specifications -- Specifications can make programs run faster -- Application of the composition principle to unity-like specifications -- Trees, ordinals and termination -- When is a functional tree transduction deterministic? -- Automata on infinite trees with counting constraints -- Directed column-convex polyominoes by recurrence relations -- Object organisation in software environments for formal methods -- Monads, indexes and transformations -- A technique for specifying and refining TCSP processes by using guards and liveness conditions -- Applications of type theory -- Feature automata and recognizable sets of feature trees -- About the theory of tree embedding -- Linear unification of higher-order patterns -- A theory of requirements capture and its applications -- Exception handling and term labelling -- Gate splitting in LOTOS specifications using abstract interpretation -- Constructing systems as object communities -- Term rewriting in CT? -- Optimal reductions in interaction systems -- Optimal solutions to pattern matching problems -- Testing for a conformance relation based on acceptance -- Testability of a communicating system through an environment -- Automating (specification = implementation) using equational reasoning and LOTOS -- On the Ehrenfeucht-Fraïssé game in theoretical computer science -- On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering -- A propositional dense time logic -- La Vraie Forme d'un Arbre -- Model checking using net unfoldings -- Reachability analysis on distributed executions -- Property preserving abstractions under parallel composition -- Types as parameters -- Polymorphic type inference with overloading and subtyping -- Type reconstruction with recursive types and atomic subtyping -- (Un)expected path lengths of asymmetric binary search trees -- Trie size in a dynamic list structure -- A fully parallel calculus of synchronizing processes -- Generic systolic arrays: A methodology for systolic design. |
| Record Nr. | UNISA-996466079703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Term Rewriting [[electronic resource] ] : French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course / / edited by Hubert Comon, Jean-Pierre Jouannaud
| Term Rewriting [[electronic resource] ] : French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course / / edited by Hubert Comon, Jean-Pierre Jouannaud |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 228 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages |
| ISBN | 3-540-49237-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | to rewriting -- 33 Examples of termination -- The word problem for Thue rewriting systems -- Word problem for Thue systems with a few relations -- Some extensions of rewriting -- Graph rewriting: A bibliographical guide -- Formal languages & word-rewriting -- Rewriting and tree automata -- On efficient reduction algorithms for some trace rewriting systems -- Automatic groups and string rewriting -- A survey of symmetrized and complete group presentations -- Normalized rewriting — Application to ground completion and standard bases -- Equational reasoning with 2-dimensional diagrams -- Affine geometry of collinearity and conditional term rewriting -- Burnside monoids word problem and the conjecture of Brzozowski. |
| Record Nr. | UNISA-996466119603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||