Principles of declarative programming : 10th International Symposium, PLILP 98 held jointly with the 6th International Conference, ALP 98 Pisa, Italy, September 16 18, 1998 : proceedings
This book constitutes the refereed proceedings of the 10th International Symposium on Programming Languages, Implementations, Logics, and Programs, PLILP'98, held jointly with the 6th International Conference on Algebraic and Logic Programming, ALP'98, in Pisa, Italy, in September 1998. Th...
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
1490 |
| 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: | • Principles of declarative programming, 10th International Symposium, PLILP'98, held jointly with the 6th International Conference, ALP'98, Pisa, Italy, September 1998, proceedings, Catuscia Palamidessi, Hugh Glaser, Karl Meinke (ed.), 1998, New York, Springer, 1 vol. (XI-497 p.), Lecture notes in computer science, 3-540-65012-1 • Principles of Declarative Programming, Texte imprimé, 9783662203316 |
Taula de continguts:
- Logic programming and model checking
- CAT: The Copying Approach to Tabling
- SICStus MT A multithreaded execution environment for SICStus Prolog
- A framework for bottom up specialisation of logic programs
- Termination of logic programs with block declarations running in several modes
- The Boolean logic of set sharing analysis
- Derivation of proof methods by abstract interpretation
- Detecting unsolvable queries for definite logic programs
- Staging static analyses using abstraction-based program specialization
- An experiment in domain refinement: Type domains and type representations for logic programs
- Architecture software using: A methodology for language development
- Explicit substitutions for objects and functions
- The complexity of late-binding in dynamic object-oriented languages
- A compiler for rewrite programs in associative-commutative theories
- Solution to the problem of Zantema on a persistent property of term rewriting systems
- A general framework for R-unification problems
- Operational versus denotational methods in the semantics of higher order languages
- Functional implementations of continuous modeled animation
- Compiling Erlang to Scheme
- From (sequential) Haskell to (parallel) Eden: An implementation point of view
- Mobile Haskell: Compiling lazy functional programs for the Java Virtual Machine
- Program analysis in ?prolog
- A game semantics foundation for logic programming
- Controlling search in declarative programs
- Encapsulating data in logic programming via categorical constraints
- Constructive negation using typed existence properties
- Optimal reduction of functional expressions
- Embedding multiset constraints into a lazy functional logic language
- A hidden Herbrand Theorem
- Integrating constraint propagation incomplete solving of linear diophantine systems
- Approaches to the incremental detection of implicit equalities with the revised simplex method.