Functional and logic programming : ; proceedings 7th international symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2998 |
| Matèries: | |
| Accés en línia: | 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, 7th international symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004, Yukiyoshi Kameyama, Peter J. Stuckey (eds.), Berlin, Springer, 2004, 1 vol. (X-306 p.), Lecture notes in computer science, 3-540-21402-X • Functional and Logic Programming, Texte imprimé, 9783662208984 |
Taula de continguts:
- Invited Papers
- A Brief Survey of Quantum Programming Languages
- Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic
- Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework
- Refereed Papers Logic and Functional-Logic Programming
- Online Justification for Tabled Logic Programs
- Constructive Intensional Negation
- Analysing Definitional Trees: Looking for Determinism
- Applications
- : a Declarative Debugging Tool for Functional-Logic Languages
- LIX: an Effective Self-applicable Partial Evaluator for Prolog
- Program Analysis
- Multivariant Non-failure Analysis via Standard Abstract Interpretation
- Set-Sharing Is Not Always Redundant for Pair-Sharing
- Backward Pair Sharing Analysis
- Rewriting
- Implementing Natural Rewriting and Narrowing Efficiently
- Complete Axiomatization of an Algebraic Construction of Graphs
- Sub-Birkhoff
- Types and Modules
- Relaxing the Value Restriction
- Rigid Mixin Modules
- Logic and Semantics
- Semantics of Linear Continuation-Passing in Call-by-Name
- A Direct Proof of Strong Normalization for an Extended Herbelin s Calculus
- Functional Programming
- Normalization by Evaluation for ? ?2
- Basic Pattern Matching Calculi: a Fresh View on Matching Failure
- Derivation of Deterministic Inverse Programs Based on LR Parsing.