Director strings as combinators
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic binding time analysis for a typed &lgr;-calculus
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental reduction in the lambda calculus
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transformations on higher-order functions
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
From λσ to λν: a journey through calculi of explicit substitutions
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequential algorithms, deterministic parallelism, and intensional expressiveness
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Rule languages and internal algebras for rule-based optimizers
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A systematic study of functional language implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
A framework for the recursive definition of data structures
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
On the expressive power of first-order boolean functions in PCF
Theoretical Computer Science
Information and Computation
Binding Logic: Proofs and Models
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Life without the Terminal Type
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Games and Full Abstraction for FPC
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A functional correspondence between evaluators and abstract machines
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Information and Computation
Event Domains, Stable Functions and Proof-Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algorithmic Interpretation of a Deep Inference System
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
New Developments in Environment Machines
Electronic Notes in Theoretical Computer Science (ENTCS)
Concrete Data Structures as Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A sound and complete CPS-translation for λµ-calculus
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A fully abstract bidomain model of unary FPC
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Musings around the geometry of interaction, and coherence
Theoretical Computer Science
A framework for point-free program transformation
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Bi-models: Relational Versus Domain-theoretic Approaches
Fundamenta Informaticae
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Deriving interpretations of the gradually-typed lambda calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
| Hi-index | 0.00 |