Logic Based Program Synthesis and Transformation [[electronic resource] ] : 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers / / edited by Maurice Bruynooghe |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 238 p.) |
Disciplina | 005.115 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Computer logic Computer programming Mathematical logic Artificial intelligence Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN |
1-280-30782-X
9786610307821 3-540-25938-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce -- Specification and Synthesis -- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures -- Correct OO Systems in Computational Logic -- Specification and Synthesis of Hybrid Automata for Physics-Based Animation -- Adding Concrete Syntax to a Prolog-Based Program Synthesis System -- Verification -- Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables -- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 -- Analysis -- A Program Transformation for Backwards Analysis of Logic Programs -- An Efficient Staging Algorithm for Binding-Time Analysis -- Proving Termination with Adornments -- Transformation and Specialisation -- Constructively Characterizing Fold and Unfold -- Deterministic Higher-Order Patterns for Program Transformation -- From Interpreter to Logic Engine by Defunctionalization -- Linearization by Program Transformation -- Continuation Semantics as Horn Clauses -- Constraints -- Simplification of Database Integrity Constraints Revisited: A Transformational Approach -- Integration and Optimization of Rule-Based Constraint Solvers -- Introducing esra, a Relational Language for Modelling Combinatorial Problems. |
Record Nr. | UNISA-996466230103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Logic Based Program Synthesis and Transformation : 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers / / edited by Maurice Bruynooghe |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (X, 238 p.) |
Disciplina | 005.115 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Computer logic Computer programming Logic, Symbolic and mathematical Artificial intelligence Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN |
1-280-30782-X
9786610307821 3-540-25938-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce -- Specification and Synthesis -- Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures -- Correct OO Systems in Computational Logic -- Specification and Synthesis of Hybrid Automata for Physics-Based Animation -- Adding Concrete Syntax to a Prolog-Based Program Synthesis System -- Verification -- Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables -- Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 -- Analysis -- A Program Transformation for Backwards Analysis of Logic Programs -- An Efficient Staging Algorithm for Binding-Time Analysis -- Proving Termination with Adornments -- Transformation and Specialisation -- Constructively Characterizing Fold and Unfold -- Deterministic Higher-Order Patterns for Program Transformation -- From Interpreter to Logic Engine by Defunctionalization -- Linearization by Program Transformation -- Continuation Semantics as Horn Clauses -- Constraints -- Simplification of Database Integrity Constraints Revisited: A Transformational Approach -- Integration and Optimization of Rule-Based Constraint Solvers -- Introducing esra, a Relational Language for Modelling Combinatorial Problems. |
Record Nr. | UNINA-9910144160903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Program Development in Computational Logic [[electronic resource] ] : A Decade of Research Advances in Logic-Based Program Development / / edited by Maurice Bruynooghe, Kung-Kiu Lau |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (VIII, 539 p.) |
Disciplina | 005.115 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Artificial intelligence
Computer logic Computer programming Mathematical logic Software engineering Programming languages (Electronic computers) Artificial Intelligence Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Software Engineering Programming Languages, Compilers, Interpreters |
ISBN |
1-280-30779-X
9786610307791 3-540-25951-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Specification and Synthesis -- Specifying Compositional Units for Correct Program Development in Computational Logic -- Synthesis of Programs in Computational Logic -- Developing Logic Programs from Specifications Using Stepwise Refinement -- Semantics -- Declarative Semantics of Input Consuming Logic Programs -- On the Semantics of Logic Program Composition -- Analysis -- Analysing Logic Programs by Reasoning Backwards -- Binding-Time Analysis for Mercury -- A Generic Framework for Context-Sensitive Analysis of Modular Programs -- Transformation and Specialisation -- Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems -- Transformation Rules for Locally Stratified Constraint Logic Programs -- Specialising Interpreters Using Offline Partial Deduction -- Termination -- Characterisations of Termination in Logic Programming -- On the Inference of Natural Level Mappings -- Proving Termination for Logic Programs by the Query-Mapping Pairs Approach -- Systems -- Herbrand Constraints in HAL. |
Record Nr. | UNISA-996466235103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Program Development in Computational Logic : A Decade of Research Advances in Logic-Based Program Development / / edited by Maurice Bruynooghe, Kung-Kiu Lau |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (VIII, 539 p.) |
Disciplina | 005.115 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Artificial intelligence
Computer logic Computer programming Logic, Symbolic and mathematical Software engineering Programming languages (Electronic computers) Artificial Intelligence Logics and Meanings of Programs Programming Techniques Mathematical Logic and Formal Languages Software Engineering Programming Languages, Compilers, Interpreters |
ISBN |
1-280-30779-X
9786610307791 3-540-25951-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Specification and Synthesis -- Specifying Compositional Units for Correct Program Development in Computational Logic -- Synthesis of Programs in Computational Logic -- Developing Logic Programs from Specifications Using Stepwise Refinement -- Semantics -- Declarative Semantics of Input Consuming Logic Programs -- On the Semantics of Logic Program Composition -- Analysis -- Analysing Logic Programs by Reasoning Backwards -- Binding-Time Analysis for Mercury -- A Generic Framework for Context-Sensitive Analysis of Modular Programs -- Transformation and Specialisation -- Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems -- Transformation Rules for Locally Stratified Constraint Logic Programs -- Specialising Interpreters Using Offline Partial Deduction -- Termination -- Characterisations of Termination in Logic Programming -- On the Inference of Natural Level Mappings -- Proving Termination for Logic Programs by the Query-Mapping Pairs Approach -- Systems -- Herbrand Constraints in HAL. |
Record Nr. | UNINA-9910144155003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Programming Language Implementation and Logic Programming [[electronic resource] ] : 5th International Symposium, PLILP '93, Tallinn, Estonia, August 25-27, 1993. Proceedings / / edited by Maurice Bruynooghe, Jaan Penjam |
Edizione | [1st ed. 1993.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
Descrizione fisica | 1 online resource (XIII, 427 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer logic Mathematical logic Computer programming Artificial intelligence Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques Artificial Intelligence |
ISBN | 3-540-47945-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Executable specifications for language implementation -- Avoiding dynamic delays in functional logic programs -- A debugging model for functional logic programs -- A conservative approach to meta-programming in constraint logic programming -- The versatility of handling disjunctions as constraints -- Efficient bottom-up abstract interpretation of prolog by means of constraint solving over symbolic finite domains (extended abstract) -- Improvements in compile-time analysis for Ground Prolog -- A new top-down parsing algorithm for left-recursive DCGs -- Specification and implementation of grammar couplings using attribute grammars -- Programming language specification and prototyping using the MAX system -- Flang and its implementation -- Efficient lazy narrowing using demandedness analysis -- A demand driven computation strategy for lazy narrowing -- Functional programming languages with logical variables: A linear logic view -- Objects with state in contextual logic programming -- A novel method for parallel implementation of findall -- A parallel implementation for AKL -- Inlining to reduce stack space -- A WAM-based implementation of a logic language with sets -- An OR parallel Prolog model for distributed memory systems -- Executing bounded quantifications on shared memory multiprocessors -- A lattice of abstract graphs -- Higher-order chaotic iteration sequences -- Proving the correctness of compiler optimisations based on strictness analysis -- Abstract complexity of prolog based on WAM -- Development of rewriting strategies -- Narrowing approximations as an optimization for equational logic programs -- Pagode: A back end generator -- SelfLog: Language and implementation -- Embedding declarative subprograms into imperative constructs -- Stack management of runtime structures in distributed implementations -- Efficient register allocation for large basic blocks -- Generation of synchronization code for parallel compilers. |
Record Nr. | UNISA-996465878103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Programming Language Implementation and Logic Programming [[electronic resource] ] : 4th International Symposium, PLILP ’92, Leuven, Belgium, August 26–28, 1992 Proceedings / / edited by Maurice Bruynooghe, Martin Wirsing |
Edizione | [1st ed. 1992.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
Descrizione fisica | 1 online resource (XI, 494 p. 27 illus.) |
Disciplina | 005.11 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Computers Programming languages (Electronic computers) Computer logic Mathematical logic Artificial intelligence Programming Techniques Theory of Computation Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-47297-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Improving control of logic programs by using functional logic languages -- Independent AND-parallel implementation of narrowing -- Binding techniques and garbage collection for OR-parallel CLP systems -- Path analysis for lazy data structures -- Why the occur-check is not a problem -- Incremental evaluation of natural semantics specifications -- Subsumption-oriented Push-Down Automata -- Unlimp uniqueness as a leitmotiv for implementation -- Using cached functions and constructors for incremental attribute evaluation -- Strictness analysis for attribute grammars -- Checking and debugging of two-level grammars -- On safe folding -- Unfold/fold transformations preserving termination properties -- A technique for transforming logic programs by fold-unfold transformations -- FOLON: An environment for declarative construction of logic programs -- A complete indexing scheme for WAM-based abstract machines -- Fast prolog with a VAM1p based Prolog compiler -- Metastructures vs. attributed variables in the context of extensible unification -- Comparing the Galois connection and widening/narrowing approaches to abstract interpretation -- Derivation of linear size relations by abstract interpretation -- Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation -- A bottom-up interpreter for a higher-order logic programming language -- Camel: An extension of the categorical abstract machine to compile functional/logic programs -- On the interaction of lazy evaluation and backtracking -- Interprocedural dynamic slicing -- Algorithmic debugging for lazy functional languages -- A general trace query mechanism based on Prolog -- Fully declarative logic programming -- Our LIPS are sealed: Interfacing functional and logic programming systems -- Analyses of inconsistency for incremental equational logic programming -- I/O trees and interactive lazy functional programming -- UCG-E: An equational logic programming system -- A relational programming system with inferred representations -- An implementation of action semantics (Summary) -- BinProlog: A continuation passing style Prolog engine -- LaToKi: A language toolkit for bottom-Up evaluation of functional programs -- Implementing higher-order functions in an algebraic specification language with narrowing -- Implementing attribute grammars by computational models -- ProQuery: Logical access to an OODB -- Inference of inheritance relationships from Prolog programs: a system developed with PrologIII -- CLP(PB). |
Record Nr. | UNISA-996465489103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|