Library Catalog
Amazon cover image
Image from Amazon.com

Algebraic and Logic Programming : Proceedings of an International Workshop held in Gaussig (GDR), November 14–18, 1988 / ed. by Jan Grabowski, Wolfgang Wechler, Pierre Lescanne.

Contributor(s): Material type: TextTextSeries: Mathematical Research : Mathematische Forschung ; 49Publisher: Berlin ; Boston : De Gruyter, [2022]Copyright date: 1988Edition: Reprint 2022Description: 1 online resource (284 p.)Content type:
Media type:
Carrier type:
ISBN:
  • 9783112620250
  • 9783112620267
Subject(s): Other classification:
  • online - DeGruyter
Online resources: Available additional physical forms:
  • Issued also in print.
Contents:
Frontmatter -- Preface -- Contents -- INVITED PAPERS -- ACP WITH SIGNALS -- FUNCTIONAL EXTENSIONS TO PROLOG: ARE THEY NEEDED? -- NARROWING AND RESOLUTION IN LOGIC-FUNCTIONAL PROGRAMMING LANGUAGES -- Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting -- OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization -- Logic Programming with Polymorphically Order-Sorted Types -- SUBMITTED PAPERS -- Integrating Logic Programming and Equational Specification of Abstract Data Types -- NARROWING WITH BUILT-IN THEORIES -- A completion procedure for hierarchical conditional rewriting systems -- An effective method for handling initial algebras -- BOOLEAN VALUED MODELS AND INCOMPLETE SPECIFICATIONS -- TYPES, MODULARISATION AND ABSTRACTION IN LOGIC PROGRAMMING -- TRANSLATING ALGEBRAIC SPECIFICATIONS TO PROLOG PROGRAMS: A COMPARATIVE STUDY -- Rewrite Rule Systems for Modal Propositional Logic -- A CHARACTERIZATION OF IRREDUCIBLE SETS MODULO LEFT-LINEAR TERM REWRITING SYSTEMS BY TREE AUTOMATA -- FUNCTIONAL DATA TEBM MODELS AND SEMANTIC UNIFICATION -- MODULAR ALGEBRAIC SPECIFICATIONS -- PROVING INDUCTIVE THEOREMS BASED ON TERM REWRITING SYSTEMS -- Jungle Evaluation for Efficient Term Rewriting -- A NEW QUASI-REDUCTIBILITY TESTING ALGORITHM AND ITS APPLICATION TO PROOFS BY INDUCTION -- FUZZY REASONING BASED ON f-HORN CLAUSE RULES -- BABEL: A Functional and Logic Programing Language based on constructor discipline and narrowing -- Refined Compilation of Pattern-Matching for Functional Languages -- NARROWING IN PARTIAL CONDITONAL EQUATIONAL THEORIES -- SOLVING EQUATIONS IN AN EQUATIONAL LANGUAGE -- NONSTANDARD LOGICS OF RECURSIVE PROGRAMS AND DENOTATIONAL SEMANTICS -- Backmatter
Holdings
Item type Current library Call number URL Status Notes Barcode
eBook eBook Biblioteca "Angelicum" Pont. Univ. S.Tommaso d'Aquino Nuvola online online - DeGruyter (Browse shelf(Opens below)) Online access Not for loan (Accesso limitato) Accesso per gli utenti autorizzati / Access for authorized users (dgr)9783112620267

Frontmatter -- Preface -- Contents -- INVITED PAPERS -- ACP WITH SIGNALS -- FUNCTIONAL EXTENSIONS TO PROLOG: ARE THEY NEEDED? -- NARROWING AND RESOLUTION IN LOGIC-FUNCTIONAL PROGRAMMING LANGUAGES -- Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting -- OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization -- Logic Programming with Polymorphically Order-Sorted Types -- SUBMITTED PAPERS -- Integrating Logic Programming and Equational Specification of Abstract Data Types -- NARROWING WITH BUILT-IN THEORIES -- A completion procedure for hierarchical conditional rewriting systems -- An effective method for handling initial algebras -- BOOLEAN VALUED MODELS AND INCOMPLETE SPECIFICATIONS -- TYPES, MODULARISATION AND ABSTRACTION IN LOGIC PROGRAMMING -- TRANSLATING ALGEBRAIC SPECIFICATIONS TO PROLOG PROGRAMS: A COMPARATIVE STUDY -- Rewrite Rule Systems for Modal Propositional Logic -- A CHARACTERIZATION OF IRREDUCIBLE SETS MODULO LEFT-LINEAR TERM REWRITING SYSTEMS BY TREE AUTOMATA -- FUNCTIONAL DATA TEBM MODELS AND SEMANTIC UNIFICATION -- MODULAR ALGEBRAIC SPECIFICATIONS -- PROVING INDUCTIVE THEOREMS BASED ON TERM REWRITING SYSTEMS -- Jungle Evaluation for Efficient Term Rewriting -- A NEW QUASI-REDUCTIBILITY TESTING ALGORITHM AND ITS APPLICATION TO PROOFS BY INDUCTION -- FUZZY REASONING BASED ON f-HORN CLAUSE RULES -- BABEL: A Functional and Logic Programing Language based on constructor discipline and narrowing -- Refined Compilation of Pattern-Matching for Functional Languages -- NARROWING IN PARTIAL CONDITONAL EQUATIONAL THEORIES -- SOLVING EQUATIONS IN AN EQUATIONAL LANGUAGE -- NONSTANDARD LOGICS OF RECURSIVE PROGRAMS AND DENOTATIONAL SEMANTICS -- Backmatter

restricted access online access with authorization star

http://purl.org/coar/access_right/c_16ec

Issued also in print.

Mode of access: Internet via World Wide Web.

In English.

Description based on online resource; title from PDF title page (publisher's Web site, viewed 19. Oct 2024)