Functional and Logic Programming

4th Fuji International Symposium, FLOPS'99 Tsukuba, Japan, November 11-13, 1999 Proceedings

AvAart Middeldorp,Taisuke Sato

Häftad, Engelska, 1999

Del i serien Lecture Notes in Computer Science

554 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 4th Fuji International Symposium on Functional and Logic Programming, FLOPS'99, held in Tsukuba, Japan, in November 1999.The 23 revised full papers presented were carefully reviewed and selected from a total of 51 submissions. The papers are devoted to various current aspects of functional and logic programming as well as to the integration of these two paradigms. Among the topics addressed are typing, partial evaluation, program transformations, parsing, formal verification, program analysis, static analysis, narrowing, etc.

Produktinformation

Utgivningsdatum:1999-10-27
Mått:155 x 235 x 21 mm
Vikt:587 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:378
Upplaga:1999
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540666776

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

Semantics and Types in Functional Logic Programming.- Polytypic Programming With Ease.- Type Inference for Overloading without Restrictions, Declarations or Annotations.- Partial Evaluation and Non-interference for Object Calculi.- Lazy Lexing is Fast.- A Functional-Logic Perspective of Parsing.- Implementing Encapsulated Search for a Lazy Functional Logic Language.- Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers.- Automatic Verification Based on Abstract Interpretation.- A Transformation System for Lazy Functional Logic Programs.- Termination Analysis of Tabled Logic Programs Using Mode and Type Information.- On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems.- An Interval Lattice-Based Constraint Solving Framework for Lattices.- Higher Order Matching for Program Transformation.- Automated Generalisation of Function Definitions.- An Extensional Characterization of Lambda-Lifting and Lambda-Dropping.- Using Types as Approximations for Type Checking Prolog Programs.- Typed Static Analysis: Application to Groundness Analysis of Prolog and ? Prolog.- A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs.- The Logical Abstract Machine: A Curry-Howard Isomorphism for Machine Code.- On Reducing the Search Space of Higher-Order Lazy Narrowing.- Typed Higher-Order Narrowing without Higher-Order Strategies.- A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages.