1 option
Algebraic and Logic Programming : 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings / edited by Michael Hanus, Jan Heering, Karl Meinke.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1298.
- Lecture Notes in Computer Science, 0302-9743 ; 1298
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Computers.
- Computer architecture.
- Computer logic.
- Logic, Symbolic and mathematical.
- Artificial intelligence.
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Computer System Implementation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Theory of Computation.
- Computer System Implementation.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (XI, 297 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997. The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69555-4
- 9783540695554
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.