The events take place at Conference Centre `Papendal' near Arnhem, the Netherlands.
The PLILP symposium aims at stimulating research on
declarative programming languages, and seeks to disseminate
insights in the relation between the logics of those languages,
implementation techniques and the use of these languages in
constructing real programs. Typical, but not exclusive topics
of interest are:
implementation of declarative concepts,
compiler specification and construction,
program transformation techniques,
implementation issues (system demonstrations),
reasoning about language constructs,
integration of different paradigms,
relation between declarative paradigms,
term rewriting, narrowing, resolution,
experiences in constructing applications,
typing and structuring systems.
Guide for authors
Fifth International Workshop on Logic Program
Synthesis and Transformation
The aim of the LoPSTr workshop is to present recent work (including work in
progress) and discuss new ideas and trends in the following fields: program
synthesis, program transformation, program specialization, partial deduction
all in the context of logic programming. Papers pointing out the
relationships of the above topics with other topics in the field of automated
program development, such as: automated deduction, constructive type theory,
implementation techniques, inductive logic programming, meta-languages,
program analysis, program specification, query optimization in deductive
databases, software engineering, synthesis and transformation in the context
of other programming languages, are presented.
1995 CompuLog-Net Meeting on Program Development
The aim of the meeting is to
bring together researchers (not necessarily network members) working on
various methodologies for developing logic programs. The topics of interest
include: program specification, synthesis, analysis, transformation,
verification, program specialization (and in particular partial deduction),
programming environments, compilation and implementation techniques,
meta-languages and meta-programming for program development.
Submit abstract before July 15,
by e-mail to email@example.com (Maurizio Proietti).
Notification of acceptance for presentation is on July 31.
1995 CompuLog-Net Workshop and Area Meeting on
Parallelism and Implementation Technology
This meeting is intended to be a communication vehicle for people interested in the implementation of Computational Logic systems. The transfer to and exploitation of such technology by industry are also issues of central interest for the meeting. The topics of interest include: implementation techniques, parallelism and concurrency, abstract machines, compilation methods, program optimization, sequential and parallel execution models, automatic parallelization, concurrent/parallel languages, performance evaluation methodologies and studies, experiences in the implementation of systems. Submit 2-3 page extended abstract (or a full paper) before June 30, by e-mail to: firstname.lastname@example.org. Notification of acceptance for presentation is on July 26. See the call for papers.
Polymorphic type systems offer both type security and flexibility, allowing the definition and use of values which behave uniformly across a range of types. Constructor classes are one attempt to increase the expressiveness of such systems without losing the benefits of effective type inference. Combining overloading in the style of Haskell type classes, and a simple form of higher-order polymorphism, constructor classes encourage the definition and use of general purpose operations that behave uniformly across a range of type constructors. We describe a number of examples, concentrating in particular on the application to programming with monads in a functional language, to illustrate the benefits of a language with support for constructor classes.
Sequential decision processes were introduced in the fifties by Richard Bellman to model certain optimisation problems. We develop a set of combinators to solve such problems in a functional programming language, and we use these combinators to write a single generic program that implements a large class of dynamic programming algorithms. The program was invented using a calculus of relations, and we briefly consider why such a calculus is helpful in achieving this type of result.
Constraint multiset grammars (CMGs) provide a general, high-level framework for the definition of two-dimensional, i.e. visual, languages. CMGs are a new formalism based on multiset rewriting and are related to logic grammars used in natural language parsing. We give a formal semantics for CMGs and investigate the complexity of parsing. We then describe tools which automatically generate from a CMG a sophisticated user interface consisting of an error-correcting incremental parser and a constraint-based graphic editor. Our research has particular application to user-interfaces for pen-based computers.
From Amsterdam Schiphol airport: railway station is at the airport. Take the train heading for Hilversum (x.02) or Lelystad (x.32). Change trains at Duivendrecht, take stairs to other platform. Train costs NLG 25 one way.
x=6...23 | x=8...23 Amsterdam Schiphol x.02 x.32 | Arnhem x.08 x.38 Duivendrecht x.16 x.46 | Duivendrecht Sx.02 Sx.32 Duivendrecht x.29 x.59 | Duivendrecht Sx.16 Sx.46 Arnhem Sx.24 Sx.55 | Schiphol Sx.31 SSx.01From Düsseldorf airport: take city transportation to Düsseldorf Hauptbahnhof. From there take direct Eurocity train heading for Amsterdam.
x=7..(odd)..21 x=18,19 | x=7,8..(even)..20 x=9,10 Düsseldorf x.39 x.26 | Arnhem x.05 x.05 21.27 22.14 Arnhem Sx.52 Sx.52 | Düsseldorf Sx.19 Sx.32 23.18 23.52In Arnhem, the best way to reach the conference centre `Papendal' is to buy a `train taxi ticket' at the railway station (NLG 6), and take a taxi designated as `train taxi' (=cheap group taxi). Other taxis cost around NLG 25.
The hard way is to go by bus: buy a `strip ticket' (NLG 11, valid for 5 bus rides) at the railway station, and take the yellow VAD bus direction Lelystad (leaves x.13, x=7...23 and x.43, x=6...8,14...17), exit at stop `West-end'.
Please register before July 17, otherwise availability of hotel accommodation cannot be guaranteed.