TAPSOFT '87 : proceedings of the International joint conference on theory and practice of software development, Pisa, Italy, March 23-27, 1987 Volume 2, Advanced seminar on foundations of innovative software development II and Colloquium on functional and logic programming and specifications (CFLP)
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
250 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987, Texte imprimé, 9783540176114 • TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987, Texte imprimé, 9783662178355 • Tapsoft '87, proceedings of the International joint conference on theory and practice of software development, Pisa, Italy, March 23-27, 1987, Volume 2, Advanced seminar on foundations of innovative software development II and Colloquium on functional and logic programming and specifications (CFLP), edited by Hartmut Ehrig, Robert Kowalski, Giogio Levi and Ugo Montanari, 1987, Berlin, Springer, 1 vol. (XIV-336 p.), Lecture notes in computer science, 3-540-17611-X |
Aurkibidea:
- Models and equality for logical programming
- Fifth generation computer project: Current research activity and future plans
- A compositive abstraction algorithm for combinatory logic
- Linear logic and lazy computation
- The natural dynamic semantics of mini-Standard ML
- Listlog A PROLOG extension for list processing
- Intensional negation of logic programs: Examples and implementation techniques
- Improving the execution speed of compiled Prolog with modes, clause selection, and determinism
- Simulation results of a multiprocessor PROLOG architecture based on a distributed and/or graph
- Generating efficient code from strictness annotations
- Hoisting: Lazy evaluation in a cold climate
- Inductive assertion method for logic programs
- Higher order generalization in program derivation
- Implementing algebraically specified abstract data types in an imperative programming language
- A declarative environment for concurrent logic programming
- Or-parallel execution models of Prolog
- Retractions: A functional paradigm for logic programming
- Refined strategies for semantic unification
- Extensional models for polymorphism
- A type discipline for program modules
- Theory and practice of canonical term functors in abstract data type specifications.