Programming Languages: Implementations, Logics, and Programs: 9th International Symposium, PLILP '97, Including a Special Track on Declarative Programming Languages in Education, Southampton, UK, September 3-5, 1997. Proceedings
Hugh Glaser, Peter Hartel, Herbert Kuchen
Springer Science & Business Media, Aug 13, 1997 - Computers - 428 pages
This volume constitutes the refereed proceedings of the 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP '97, held in Southampton, UK, in September 1997, including a special track on Declarative Programming in Education.
The volume presents 25 revised full papers selected from 68 submissions. Also included are one invited paper and three posters. The papers are devoted to exploring the relation between implementation techniques, the logic of the languages, and the use of the languages in construcing real programs. Topics of interest include implementation of declarative concepts, integration of paradigms, program analysis and transformation, programming environments, executable specifications, reasoning about language constructs, etc.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Narrowing the Narrowing Space
An Object Calculus with Algebraic Rewriting
Inheritance and Selective Method Dispatching in Concurrent Haskell
Overriding Operators in a MixinBased Framework
Resolution for Logic Programming with Universal Quantifiers
A Declarative Approach to Concurrent Programming
Conquer to Nested Parallel Loops
Transforming Lazy Functions Using Comportment Properties
An OpenEnded Finite Domain Constraint Solver
Semantics and Compilation of Recursive Sequential Streams in 8 12
Implementation of Term Rewritings with the Evaluation Strategy
Reflections on Reflections
Evaluation Under Lambda Abstraction
Selective Recomputation for Handling SideEffects in Parallel Logic Programs
Tracing Lazy Functional Computations Using Redex Trails
Functional Programming and Geometry
Transformations for Efficient Evaluations in Functional Programming
when and how?
HigherOrder Value Flow Graphs
Intuitionistic Implication in Abstract Interpretation
Where Do I Begin? A Problem Solving Approach in Teaching Functional Programming
Teaching Functional and Logic Programming with a Single Computation Model
Logic Implemented Functionally
Other editions - View all
A-calculus abstract domain abstract interpretation algebraic algorithm analysis application argument Bool calculus child tree clock compiler computed expressions Computer Science concurrent constraint construction constructor corresponding CPS translation defined definitional tree denote disjunctive DrScheme E-strategy equations evaluation example execution finite functional languages functional programming Galois connection ghd(M GHNF goal graph Haskell implementation induction inference engine inline expansion inlining input interface isometry lazy evaluation logic pro logic programming loop m-node memoization method mixin narrowing space node normal object operational semantics operator optimizations output parallel predicate problem Proc Programming Languages Prolog q-normal recomputation recursive recursive types redex reduction replacing-independent restricted quantification result rewrite rules run-time Sabry Scheme semantics sequence sequential side-effect built-ins Smalltalk solution solving strategy list stream structure substitution syntactic syntax Tempo term Theorem tion trace transformation variables weak overriding