Algebraic and Logic Programming [[electronic resource] ] : Third International Conference, Volterra, Italy, September 2-4, 1992. Proceedings / / edited by Helene Kirchner, Giorgio Levi |
Edizione | [1st ed. 1992.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
Descrizione fisica | 1 online resource (IX, 460 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Software engineering Programming languages (Electronic computers) Computer logic Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages |
ISBN | 3-540-47302-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Outline of an object-oriented calculus of higher type -- High-level-replacement systems for equational algebraic specifications -- Termination of rewrite systems by elementary interpretations -- Termination of order-sorted rewriting -- Generalized sufficient conditions for modular termination of rewriting -- A theory of first-order built-in's of prolog -- Fixpoint semantics for partial computed answer substitutions and call patterns -- Oracle semantics for Prologa -- On the relation between primitive recursion, schematization, and divergence -- Term rewriting with sharing and memoïzation -- Definitional trees -- Multiparadigm logic programming -- Non-linear real constraints in constraint logic programming -- A general scheme for constraint functional logic programming -- Incremental rewriting in narrowing derivations -- Counterexamples to completeness results for basic narrowing (extended abstract) -- Uniform narrowing strategies -- Proof by consistency in constructive systems with final algebra semantics -- A fast algorithm for ground normal form analysis -- Eta-conversion for the languages of explicit substitutions -- Serialisation analysis of concurrent logic programs -- Implementation of a toolset for prototyping algebraic specifications of concurrent systems -- Axiomatizing permutation equivalence in the ?-calculus -- A CLP view of logic programming -- Partial deduction of logic programs WRT well-founded semantics -- The finiteness of logic programming derivations -- Theorem proving for hierarchic first-order theories -- A goal oriented strategy based on completion -- On n-syntactic equational theories. |
Record Nr. | UNISA-996465485803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic and Logic Programming [[electronic resource] ] : Second International Conference, Nancy, France, October 1-3, 1990. Proceedings / / edited by Helene Kirchner, Wolfgang Wechler |
Edizione | [1st ed. 1990.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
Descrizione fisica | 1 online resource (IX, 389 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Artificial intelligence Mathematical logic Software Engineering/Programming and Operating Systems Artificial Intelligence Mathematical Logic and Formal Languages Software Engineering |
ISBN | 3-540-46738-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Proving and rewriting -- Proving correctness w.r.t. specifications with hidden parts -- Hybrid implementations of algebraic specifications -- Multi-modal logic programming using equational and order-sorted logic -- Logic programs with equational type specifications -- Higher-order order-sorted algebras -- Axiomatization of a functional logic language -- Fourier algorithm revisited -- Fixpoint techniques for non-monotone maps -- Domain theory for nonmonotonic functions -- On the strong completion of logic programs -- An equivalence preserving first order unfold/fold transformation system -- Propositional calculus problems in CHIP -- Unfolding and fixpoint semantics of concurrent constraint logic programs -- Eliminating negation from normal logic programs -- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic -- Recursive query processing in predicate-goal graph -- Implementation of completion by transition rules + control: ORME -- A matching process modulo a theory of categorical products -- Equation solving in conditional AC-theories -- Lazy narrowing in a graph machine -- An abstract concurrent machine for rewriting -- Applying term rewriting methods to finite groups -- Termination proofs by multiset path orderings imply primitive recursive derivation lengths -- Optimization of rewriting and complexity of rewriting -- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering. |
Record Nr. | UNISA-996465868903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic Methodology and Software Technology [[electronic resource] ] : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XII, 508 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Software engineering Algebra Computer logic Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
ISBN | 3-540-45719-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- From Specifications to Code in Casl -- Automata and Games for Synthesis -- Pragmatics of Modular SOS -- Tool-Assisted Specification and Verification of the JavaCard Platform -- Higher-Order Quantification and Proof Search* -- Algebraic Support for Service-Oriented Architecture -- Regular Papers -- Fully Automatic Adaptation of Software Components Based on Semantic Specifications* -- HasCasl: Towards Integrated Specification and Development of Functional Programs -- Removing Redundant Arguments of Functions* -- A Class of Decidable Parametric Hybrid Systems -- Vacuity Checking in the Modal Mu-Calculus* -- On Solving Temporal Logic Queries -- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations* -- An Algebra of Non-safe Petri Boxes -- Refusal Simulation and Interactive Games -- A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching -- Equational Axioms for Probabilistic Bisimilarity -- Bisimulation by Unification* -- Transforming Processes to Check and Ensure Information Flow Security* -- On Bisimulations for the Spi Calculus* -- Specifying and Verifying a Decimal Representation in Java for Smart Cards* -- A Method for Secure Smartcard Applications -- Extending JML Specifications with Temporal Logic -- Algebraic Dynamic Programming -- Analyzing String Buffers in C -- A Foundation of Escape Analysis* -- A Framework for Order-Sorted Algebra -- Guarded Transitions in Evolving Specifications -- Revisiting the Categorical Approach to Systems* -- Proof Transformations for Evolutionary Formal Software Development -- Sharing Objects by Read-Only References -- Class-Based versus Object-Based: A Denotational Comparison -- System Descriptions -- BRAIN: Backward Reachability Analysis with Integers -- The Development Graph Manager Maya. |
Record Nr. | UNISA-996466342103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XII, 508 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Software engineering Algebra Computer logic Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
ISBN | 3-540-45719-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- From Specifications to Code in Casl -- Automata and Games for Synthesis -- Pragmatics of Modular SOS -- Tool-Assisted Specification and Verification of the JavaCard Platform -- Higher-Order Quantification and Proof Search* -- Algebraic Support for Service-Oriented Architecture -- Regular Papers -- Fully Automatic Adaptation of Software Components Based on Semantic Specifications* -- HasCasl: Towards Integrated Specification and Development of Functional Programs -- Removing Redundant Arguments of Functions* -- A Class of Decidable Parametric Hybrid Systems -- Vacuity Checking in the Modal Mu-Calculus* -- On Solving Temporal Logic Queries -- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations* -- An Algebra of Non-safe Petri Boxes -- Refusal Simulation and Interactive Games -- A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching -- Equational Axioms for Probabilistic Bisimilarity -- Bisimulation by Unification* -- Transforming Processes to Check and Ensure Information Flow Security* -- On Bisimulations for the Spi Calculus* -- Specifying and Verifying a Decimal Representation in Java for Smart Cards* -- A Method for Secure Smartcard Applications -- Extending JML Specifications with Temporal Logic -- Algebraic Dynamic Programming -- Analyzing String Buffers in C -- A Foundation of Escape Analysis* -- A Framework for Order-Sorted Algebra -- Guarded Transitions in Evolving Specifications -- Revisiting the Categorical Approach to Systems* -- Proof Transformations for Evolutionary Formal Software Development -- Sharing Objects by Read-Only References -- Class-Based versus Object-Based: A Denotational Comparison -- System Descriptions -- BRAIN: Backward Reachability Analysis with Integers -- The Development Graph Manager Maya. |
Record Nr. | UNINA-9910768450903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Frontiers of Combining Systems [[electronic resource] ] : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (X, 298 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Mathematical logic
Artificial intelligence Mathematical Logic and Foundations Artificial Intelligence Mathematical Logic and Formal Languages |
ISBN | 3-540-46421-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Combining Logic and Optimization in Cutting Plane Theory -- Session 1 -- Towards Cooperative Interval Narrowing -- Integrating Constraint Solving into Proof Planning -- Termination of Constraint Contextual Rewriting -- Invited Paper -- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination -- Session 2 -- Normal Forms and Proofs in Combined Modal and Temporal Logics -- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic -- Session 3 -- Handling Differential Equations with Constraints for Decision Support -- Non-trivial Symbolic Computations in Proof Planning -- Integrating Computer Algebra and Reasoning through the Type System of Aldor -- Invited Paper -- Combinations of Model Checking and Theorem Proving -- Session 4 -- Compiling Multi-paradigm Declarative Programs into Prolog -- Modular Redundancy for Theorem Proving -- Composing and Controlling Search in Reasoning Theories Using Mappings -- Invited Paper -- Why Combined Decision Problems Are Often Intractable -- Session 5 -- Congruence Closure Modulo Associativity and Commutativity -- Combining Equational Theories Sharing Non-Collapse-Free Constructors -- Comparing Expressiveness of Set Constructor Symbols. |
Record Nr. | UNISA-996466124503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Frontiers of Combining Systems : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (X, 298 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Mathematical logic
Artificial intelligence Mathematical Logic and Foundations Artificial Intelligence Mathematical Logic and Formal Languages |
ISBN | 3-540-46421-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Paper -- Combining Logic and Optimization in Cutting Plane Theory -- Session 1 -- Towards Cooperative Interval Narrowing -- Integrating Constraint Solving into Proof Planning -- Termination of Constraint Contextual Rewriting -- Invited Paper -- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination -- Session 2 -- Normal Forms and Proofs in Combined Modal and Temporal Logics -- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic -- Session 3 -- Handling Differential Equations with Constraints for Decision Support -- Non-trivial Symbolic Computations in Proof Planning -- Integrating Computer Algebra and Reasoning through the Type System of Aldor -- Invited Paper -- Combinations of Model Checking and Theorem Proving -- Session 4 -- Compiling Multi-paradigm Declarative Programs into Prolog -- Modular Redundancy for Theorem Proving -- Composing and Controlling Search in Reasoning Theories Using Mappings -- Invited Paper -- Why Combined Decision Problems Are Often Intractable -- Session 5 -- Congruence Closure Modulo Associativity and Commutativity -- Combining Equational Theories Sharing Non-Collapse-Free Constructors -- Comparing Expressiveness of Set Constructor Symbols. |
Record Nr. | UNINA-9910144132403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|