Programming languages : implementations, logics, and programs : 9th international symposium, PLILP '97 including a special track on declarative programming languages in education, Southampton, UK, September 1-3, 1997 : proceedings
This volume constitutes the refereed proceedings of the 9th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP '97, held in Southampton, UK, in September 1997, including a special track on Declarative Programming in Education. The volume presents 25 re...
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
1292 |
| Materias: | |
| Acceso en línea: | 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: | • Programming languages, implementations, logics, and programs, 9th international symposium, PLILP '97 including a special track on declarative programming languages in education, Southampton, UK, September 1-3, 1997, proceedings, Hugh Glaser, Pieter Hartel, Herbert Kuchen, eds, 1997, Berlin, Springer, 1 vol. (424 p.), Lecture notes in computer science, 3-540-63398-7 • Programming Languages: Implementations, Logics, and Programs, Texte imprimé, 9783662168431 |
Tabla de Contenidos:
- Narrowing the narrowing space
- An object calculus with algebraic rewriting
- Inheritance and selective method dispatching in concurrent Haskell
- Overriding operators in a mixin-based framework
- Resolution for logic programming with universal quantifiers
- A declarative approach to concurrent programming
- Transformation of divide & conquer to nested parallel loops
- Transforming lazy functions using comportment properties
- Transformations for efficient evaluations in functional programming
- Inline expansion: When and how?
- Higher-order value flow graphs
- Intuitionistic implication in abstract interpretation
- An open-ended finite domain constraint solver
- Semantics and compilation of recursive sequential streams in 81/2
- Implementation of term rewritings with the evaluation strategy
- Reflections on reflections
- Evaluation under lambda abstraction
- Selective recomputation for handling side-effects in parallel logic programs
- Tracing lazy functional computations using redex trails
- Functional programming and geometry
- Where do I begin? A problem solving approach in teaching functional programming
- Teaching functional and logic programming with a single computation model
- Logic implemented functionally
- DrScheme: A pedagogic programming environment for scheme
- An editor for helping novices to learn standard ML
- Introducing the declarative dungeon
- A pragmatic approach to compilation of Erlang
- Formal translations described by translation grammars with LR(k) input grammars
- Automatic run-time code generation in object-oriented languages.

