Programming Languages: Implementations, Logics, and Programs: 9th International Symposium, PLILP '97, Including a Special Track on Declarative Programming Languages in Education, Southampton, UK, September 3-5, 1997. ProceedingsHugh Glaser, Peter Hartel, Herbert Kuchen Springer Science & Business Media, 1997. gada 13. aug. - 428 lappuses 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 revised full papers selected from 68 submissions. Also included are one invited paper and three posters. The papers are devoted to exploring the relation between implementation techniques, the logic of the languages, and the use of the languages in construcing real programs. Topics of interest include implementation of declarative concepts, integration of paradigms, program analysis and transformation, programming environments, executable specifications, reasoning about language constructs, etc. |
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Saturs
Narrowing the Narrowing Space | 1 |
An Object Calculus with Algebraic Rewriting | 17 |
Inheritance and Selective Method Dispatching in Concurrent Haskell | 33 |
Overriding Operators in a MixinBased Framework | 47 |
Resolution for Logic Programming with Universal Quantifiers | 63 |
A Declarative Approach to Concurrent Programming | 79 |
Conquer to Nested Parallel Loops | 95 |
Transforming Lazy Functions Using Comportment Properties | 111 |
An OpenEnded Finite Domain Constraint Solver | 191 |
Semantics and Compilation of Recursive Sequential Streams in 8 12 | 207 |
Implementation of Term Rewritings with the Evaluation Strategy | 225 |
Reflections on Reflections | 241 |
Evaluation Under Lambda Abstraction | 259 |
Selective Recomputation for Handling SideEffects in Parallel Logic Programs | 275 |
Tracing Lazy Functional Computations Using Redex Trails | 291 |
Functional Programming and Geometry | 309 |
Transformations for Efficient Evaluations in Functional Programming | 127 |
when and how? | 143 |
HigherOrder Value Flow Graphs | 159 |
Intuitionistic Implication in Abstract Interpretation | 175 |
Where Do I Begin? A Problem Solving Approach in Teaching Functional Programming | 323 |
Teaching Functional and Logic Programming with a Single Computation Model | 335 |
Logic Implemented Functionally | 351 |
Citi izdevumi - Skatīt visu
Programming Languages: Implementations, Logics, and Programs: 9th ... Hugh Glaser,Peter Hartel,Herbert Kuchen Priekšskatījums nav pieejams - 2014 |
Bieži izmantoti vārdi un frāzes
abstract algebraic algorithm allows analysis application approach argument clock compiler complete Computer Science concurrent consider constraint construction constructor contains corresponding course defined definition denotes described domain elements equations evaluation event example execution expressions extended Figure function functional programming give given goal graph implementation inlining input instance interpretation introduced lazy length logic programming matching method mixin narrowing node normal Note object obtain occurrences operator optimizations parallel pattern performance position possible present problem Proceedings Programming Languages proof properties provides recursive redex reduction References reflection relation replaced represent representation require restricted result rewrite rules Scheme semantics sequence side-effect solution solving space specification step strategy stream structure substitution techniques term trace transformation translation tree true University variables