Algebraic and Logic Programming [[electronic resource] ] : 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings / / edited by Michael Hanus, Jan Heering, Karl Meinke |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (XI, 297 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Computers Architecture, Computer Computer logic Mathematical logic Artificial intelligence Programming Languages, Compilers, Interpreters Theory of Computation Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-69555-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Safe folding/unfolding with conditional narrowing -- Optimal non-deterministic functional logic computations -- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints -- Parallelizing functional programs by generalization -- Higher-order equational unification via explicit substitutions -- Parameterised higher-order algebraic specifications -- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language -- On composable properties of term rewriting systems -- Needed reductions with context-sensitive rewriting -- Conditional term graph rewriting -- Lazy narrowing with parametric order sorted types -- Termination of algebraic type systems: The syntactic approach -- Proof net semantics of proof search computation -- Explicit substitutions for the ??-calculus -- A left-linear variant of ?? -- Perpetuality and uniform normalization -- Model generation with existentially quantified variables and constraints -- Optimal left-to-right pattern-matching automata. |
Record Nr. | UNISA-996465769803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic and Logic Programming [[electronic resource] ] : 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings / / edited by Michael Hanus, Jan Heering, Karl Meinke |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (XI, 297 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Computers Architecture, Computer Computer logic Mathematical logic Artificial intelligence Programming Languages, Compilers, Interpreters Theory of Computation Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-69555-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Safe folding/unfolding with conditional narrowing -- Optimal non-deterministic functional logic computations -- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints -- Parallelizing functional programs by generalization -- Higher-order equational unification via explicit substitutions -- Parameterised higher-order algebraic specifications -- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language -- On composable properties of term rewriting systems -- Needed reductions with context-sensitive rewriting -- Conditional term graph rewriting -- Lazy narrowing with parametric order sorted types -- Termination of algebraic type systems: The syntactic approach -- Proof net semantics of proof search computation -- Explicit substitutions for the ??-calculus -- A left-linear variant of ?? -- Perpetuality and uniform normalization -- Model generation with existentially quantified variables and constraints -- Optimal left-to-right pattern-matching automata. |
Record Nr. | UNINA-9910144916403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computer Science Logic [[electronic resource] ] : 7th Workshop, CSL '93, Swansea, United Kingdom, September 13 - 17, 1993. Selected Papers / / edited by Egon Börger, Yuri Gurevich, Karl Meinke |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (VIII, 336 p.) |
Disciplina | 004/.01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Computer logic Mathematical logic Artificial intelligence Theory of Computation Logics and Meanings of Programs Mathematical Logic and Foundations Mathematical Logic and Formal Languages Computation by Abstract Devices Artificial Intelligence |
ISBN | 3-540-48599-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The complexity of set constraints -- On duality for the modal ?-calculus -- Short proofs of tautologies using the schema of equivalence -- Process algebra with combinators -- Is game semantics necessary? -- The model theory of concurrency -- From semantics to rules: A machine assisted analysis -- On the reasons for average superlinear speedup in parallel backtrack search -- Negation as inconsistency in PROLOG via intuitionistic logic -- Approximable minimization problems and optimal solutions on random inputs -- Bounded-arity hierarchies in fixed-point logics -- Petri nets and the equivalence problem -- Logical aspects of set constraints -- Oracles and quantifiers -- A Horn clause that implies an undecidable set of Horn clauses -- Higher-order action calculi -- A generic strong normalization argument: Application to the Calculus of Constructions -- Data types, infinity and equality in system AF 2 -- Normalization for typed lambda calculi with explicit substitution -- Program transformation and proof transformation -- Incorporating generalized quantifiers and the least fixed point operator -- “The semantics of the C programming language”. |
Record Nr. | UNISA-996466099903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Higher-Order Algebra, Logic, and Term Rewriting [[electronic resource] ] : Second International Workshop, HOA '95, Paderborn, Germany, September 1995. Selected Papers / / edited by Gilles Dowek, Jan Heering, Karl Meinke, Bernhard Möller |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (VIII, 296 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Computer logic Mathematical logic Theory of Computation Logics and Meanings of Programs Mathematical Logic and Formal Languages Mathematical Logic and Foundations |
ISBN | 3-540-68389-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Term graph rewriting -- Approximation and normalization results for typeable term rewriting systems -- Modular properties of algebraic type systems -- Collapsing partial combinatory algebras -- A complete proof system for Nested Term Graphs -- R n - and G n -logics -- The variable containment problem -- Higher-order equational logic for specification, simulation and testing -- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving -- Assertions and recursions -- Development closed critical pairs -- Two different strong normalization proofs? -- Third-order matching in the polymorphic lambda calculus -- Higher-order algebra with transfinite types -- Abstraction of hardware construction. |
Record Nr. | UNISA-996465596103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Higher-Order Algebra, Logic, and Term Rewriting [[electronic resource] ] : First International Workshop, HOA '93, Amsterdam, The Netherlands, September 23 - 24, 1993. Selected Papers / / edited by Jan Heering, Karl Meinke, Bernhard Möller, Tobias Nipkow |
Edizione | [1st ed. 1994.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
Descrizione fisica | 1 online resource (IX, 351 p.) |
Disciplina | 005.1/01/5113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Computers Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Mathematical Logic and Foundations |
ISBN | 3-540-48579-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Interaction systems -- Strong normalization of typeable rewrite systems -- A transformation system combining partial evaluation with term rewriting -- Prototyping relational specifications using higher-order objects -- Origin tracking for higher-order term rewriting systems -- Theory interpretation in simple type theory -- The semantics of SPECTRUM -- ATLAS: A typed language for algebraic specification -- Compilation of Combinatory Reduction Systems -- Specification and verification in higher order algebra: A case study of convolution -- Ordered and continuous models of higher-order specifications -- Rewriting properties of combinators for rudimentary linear logic -- Comparing combinatory reduction systems and higher-order rewrite systems -- Termination proofs for higher-order rewrite systems -- Extensions of initial models and their second-order proof systems. |
Record Nr. | UNISA-996466092403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Machine Learning for Dynamic Software Analysis: Potentials and Limits [[electronic resource] ] : International Dagstuhl Seminar 16172, Dagstuhl Castle, Germany, April 24-27, 2016, Revised Papers / / edited by Amel Bennaceur, Reiner Hähnle, Karl Meinke |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (IX, 257 p. 38 illus.) |
Disciplina | 006.31 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Artificial intelligence Computers Software Engineering/Programming and Operating Systems Artificial Intelligence Theory of Computation |
ISBN | 3-319-96562-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Testing and Learning -- Extensions of Automata Learning -- Integrative Approaches. |
Record Nr. | UNISA-996466190603316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Machine Learning for Dynamic Software Analysis: Potentials and Limits : International Dagstuhl Seminar 16172, Dagstuhl Castle, Germany, April 24-27, 2016, Revised Papers / / edited by Amel Bennaceur, Reiner Hähnle, Karl Meinke |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (IX, 257 p. 38 illus.) |
Disciplina | 006.31 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Artificial intelligence Computers Software Engineering/Programming and Operating Systems Artificial Intelligence Theory of Computation |
ISBN | 3-319-96562-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Testing and Learning -- Extensions of Automata Learning -- Integrative Approaches. |
Record Nr. | UNINA-9910349418603321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Principles of Declarative Programming [[electronic resource] ] : 10th International Symposium PLILP'98, Held Jointly with the 6th International Conference ALP'98, Pisa, Italy, September 16-18, 1998 Proceedings / / edited by Catuscia Palamidessi, Hugh Glaser, Karl Meinke |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XII, 504 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Computer logic Computer programming Mathematical logic Artificial intelligence Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-49766-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Logic programming and model checking -- CAT: The Copying Approach to Tabling -- SICStus MT—A multithreaded execution environment for SICStus Prolog -- A framework for bottom up specialisation of logic programs -- Termination of logic programs with block declarations running in several modes -- The Boolean logic of set sharing analysis -- Derivation of proof methods by abstract interpretation -- Detecting unsolvable queries for definite logic programs -- Staging static analyses using abstraction-based program specialization -- An experiment in domain refinement: Type domains and type representations for logic programs -- Architecture software using: A methodology for language development -- Explicit substitutions for objects and functions -- The complexity of late-binding in dynamic object-oriented languages -- A compiler for rewrite programs in associative-commutative theories -- Solution to the problem of Zantema on a persistent property of term rewriting systems -- A general framework for R-unification problems -- Operational versus denotational methods in the semantics of higher order languages -- Functional implementations of continuous modeled animation -- Compiling Erlang to Scheme -- From (sequential) Haskell to (parallel) Eden: An implementation point of view -- Mobile Haskell: Compiling lazy functional programs for the Java Virtual Machine -- Program analysis in ?prolog -- A game semantics foundation for logic programming -- Controlling search in declarative programs -- Encapsulating data in logic programming via categorical constraints -- Constructive negation using typed existence properties -- Optimal reduction of functional expressions -- Embedding multiset constraints into a lazy functional logic language -- A hidden Herbrand Theorem -- Integrating constraint propagation in complete solving of linear diophantine systems -- Approaches to the incremental detection of implicit equalities with the revised simplex method. |
Record Nr. | UNISA-996466154603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Principles of Declarative Programming [[electronic resource] ] : 10th International Symposium PLILP'98, Held Jointly with the 6th International Conference ALP'98, Pisa, Italy, September 16-18, 1998 Proceedings / / edited by Catuscia Palamidessi, Hugh Glaser, Karl Meinke |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XII, 504 p.) |
Disciplina | 005.13/1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Programming languages (Electronic computers)
Computer logic Computer programming Mathematical logic Artificial intelligence Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-49766-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Logic programming and model checking -- CAT: The Copying Approach to Tabling -- SICStus MT—A multithreaded execution environment for SICStus Prolog -- A framework for bottom up specialisation of logic programs -- Termination of logic programs with block declarations running in several modes -- The Boolean logic of set sharing analysis -- Derivation of proof methods by abstract interpretation -- Detecting unsolvable queries for definite logic programs -- Staging static analyses using abstraction-based program specialization -- An experiment in domain refinement: Type domains and type representations for logic programs -- Architecture software using: A methodology for language development -- Explicit substitutions for objects and functions -- The complexity of late-binding in dynamic object-oriented languages -- A compiler for rewrite programs in associative-commutative theories -- Solution to the problem of Zantema on a persistent property of term rewriting systems -- A general framework for R-unification problems -- Operational versus denotational methods in the semantics of higher order languages -- Functional implementations of continuous modeled animation -- Compiling Erlang to Scheme -- From (sequential) Haskell to (parallel) Eden: An implementation point of view -- Mobile Haskell: Compiling lazy functional programs for the Java Virtual Machine -- Program analysis in ?prolog -- A game semantics foundation for logic programming -- Controlling search in declarative programs -- Encapsulating data in logic programming via categorical constraints -- Constructive negation using typed existence properties -- Optimal reduction of functional expressions -- Embedding multiset constraints into a lazy functional logic language -- A hidden Herbrand Theorem -- Integrating constraint propagation in complete solving of linear diophantine systems -- Approaches to the incremental detection of implicit equalities with the revised simplex method. |
Record Nr. | UNINA-9910767565203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|