Functional and Logic Programming 4th Fuji International Symposium, FLOPS'99 Tsukuba, Japan, November 11-13, 1999 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Middeldorp, Aart (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sato, Taisuke (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Computer Science, 1722
• Θέματα: Computer programming.; Programming languages (Electronic computers).; Computer logic.; Artificial intelligence.; Programming Techniques.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Artificial Intelligence.

This volume contains the papers presented at the 4th Fuji International S- posium on Functional and Logic Programming (FLOPS'99) held in Tsukuba, Japan, November 11-13, 1999, and hosted by the Electrotechnical Laboratory (ETL). FLOPS is a forum for presenting and discussing all issues concernin...

Πίνακας περιεχομένων:

• 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.