JFP 1994
20 papers
- A - Translation and Looping Combinators in Pure Type Systems
- A Functional Animation Starter-Lit
- A Paradigmatic Object-Oriented Programming Language: Design, Static Typing and Semantics
- Algorithmic Debugging for Lazy Functional Languages
- An Overview of the Flagship System
- Baby Modula-3 and a Theory of Objects
- Book Review: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic by Mike Gordon and Tom Melham (eds.), Cambridge University Press, 1993, ISBN 0-521-44189-7
- How Powerful are Folding/Unfolding Transformations?
- Lilac: A Functional Programming Language Based on Linear Logic
- On Generating unique Names
- On the Equivalence Between CMC and TIM
- On the Generation of Specializers
- Principal Signatures for Higher-Order Program Modules
- Residual Theory in lambda-Calculus: A Formal Development
- Safe Fusion of Functional Expressions II: Further Improvements
- Simple Type-Theoretic Foundations for Object-Oriented Programming
- The Complexity of Type Inference for Higher-Order Typed lambda Calculi
- Total Unfolding: Theory and Applications
- Worst Case Scheduling for Parallel Functional Programs
- Yet Yet a Counterexample for lambda + SP