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. |
No grāmatas satura
1.–5. rezultāts no 31.
2. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
12. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
106. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
118. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
127. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
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
A-calculus abstract domain abstract interpretation algebraic algorithm analysis application argument Bool calculus child tree clock compiler computed expressions Computer Science concurrent constraint constructor corresponding CPS translation defined definitional tree denotes disjunctive DrScheme E-strategy equations evaluation example execution finite functional languages functional programming Galois connection ghd(M GHNF goal graph Haskell implementation induction inference engine inline expansion inlining input interface isometry lazy evaluation logic programming m-node memoization method mixin narrowing space node normal object operational semantics operator optimizations output parallel predicate problem Proc Programming Languages Prolog q-normal recomputation recursive recursive types redex reduction replacing-independent restricted quantification result rewrite rules run-time Sabry Scheme semantics sequence sequential side-effect built-ins Smalltalk solving strategy list stream structure substitution syntax term Theorem trace transformation type inference variables weak overriding worf