default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5. ESOP 1994: Edinburgh, U.K.
- Donald Sannella:
Programming Languages and Systems - ESOP'94, 5th European Symposium on Programming, Edinburgh, UK, April 11-13, 1994, Proceedings. Lecture Notes in Computer Science 788, Springer 1994, ISBN 3-540-57880-3
Invited Papers
- Martín Abadi, Luca Cardelli:
A Theory of Primitive Objects - Scond-Order Systems. 1-25 - Robin Milner:
Pi-Nets: A Graphical Form of pi-Calculus. 26-42
Contributed Papers
- Torben Amtoft:
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration. 43-57 - Henrik Reif Andersen, Michael Mendler:
An Asynchronous Algebra with Multiple Clocks. 58-73 - James H. Andrews:
Foundational Issues in Implementing Constraint Logic Programming Systems. 74-88 - Bernard Berthomieu, Thierry Le Sergent:
Programming with Behaviors in an ML Framework - The Syntax and Semantics of LCS. 89-104 - Michel Bidoit, Rolf Hennicker, Martin Wirsing:
Characterizing Behavioural Semantics and Abstractor Semantics. 105-119 - Luca Boerio:
Extending Pruning Techniques to Polymorphic Second order Lambda-Calculus. 120-134 - Corrado Böhm, Adolfo Piperno, Stefano Guerrini:
Lambda-Definition of Function(al)s by Normal Forms. 135-149 - Karl-Heinz Buth:
Simulation of SOS Definitions with Term Rewriting Systems. 150-164 - Serafino Cicerone, Francesco Parisi-Presicce:
Strategies in Modular System Design by Interface Rewriting. 165-179 - Marc-Michel Corsini, Antoine Rauzy:
Symbolic Model Checking and Constraint Logic Programming: a Cross-Fertilization. 180-194 - Alessandra Di Pierro
, Catuscia Palamidessi:
A Logical Denotational Semantics for Constraint Logic Programming. 195-210 - Pascal Fradet:
Compilation of Head and Strong Reduction. 211-224 - Robert Giegerich, Stefan Kurtz:
Suffix Trees in the Functional Programming Paradigm. 225-240 - Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, Philip Wadler:
Type Classes in Haskell. 241-256 - Chris Hankin, Daniel Le Métayer:
Lazy Type Inference for the Strictness Analysis of Lists. 257-271 - Michael Hanus:
Lazy Unification with Simplification. 272-286 - Fritz Henglein, Christian Mossin:
Polymorphic Binding-Time Analysis. 287-301 - C. Barry Jay, J. Robin B. Cockett:
Shapely Types and Shape Polymorphism. 302-316 - Johan Jeuring, S. Doaitse Swierstra:
Bottom-up Grammar Analysis - A Functional Formulation. 317-332 - Stefan Kahrs:
First-Class Polymorphism for ML. 333-347 - Andrew Kennedy:
Dimension Types. 348-362 - Andy King:
A Synergistic Analysis for Sharing and Groundness with Traces Linearity. 363-378 - Benjamin Z. Li:
A pi-Calculus Specification of Prolog. 379-393 - Wei Li:
A Logical Framework for Evolution of Specifications. 394-408 - David B. MacQueen, Mads Tofte:
A Semantics for Higher-Order Functors. 409-423 - Luc Moreau:
The PCKS-Machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations. 424-438 - Andy Mück, Thomas Streicher:
A Tiny Constrain Functional Logic Language and Its Continuation Semantics. 439-453 - Peter W. O'Hearn, Jon G. Riecke:
Fully Abstract Translations and Parametric Polymorphism. 454-468 - K. V. S. Prasad:
Broadcasting with Priority. 469-484 - Morten Heine Sørensen, Robert Glück, Neil D. Jones:
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC. 485-500 - David Walker:
Algebraic Proofs of Properties of Objects. 501-516
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-21 20:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
