Functional and logic programming : 4th Fuji International Symposium, FLOPS 99, Tsukuba, Japan, November 11-13, 1999 : proceedings
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 concerning fun...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
1722 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Functional and logic programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, proceedings, Aart Middeldorp, Taisuke Sato (eds.), 1999, New York, Springer, 1 vol. (X-368 p.), Lecture notes in computer science, 3-540-66677-X • Functional and Logic Programming, Texte imprimé, 9783662169544 |
Sommario:
- 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.