Samson Abramsky

According to our database, Samson Abramsky authored at least 157 papers between 1983 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Arboreal Categories: An Axiomatic Theory of Resources.

Samson Abramsky, Luca Reggio

Log. Methods Comput. Sci., 2023

Combining contextuality and causality: a game semantics approach.

Samson Abramsky, Rui Soares Barbosa, Amy Searle

CoRR, 2023

Linear Arboreal Categories.

Samson Abramsky, Yoàv Montacute, Nihil Shah

CoRR, 2023

2022

Structure and Power: an Emerging Landscape.

Samson Abramsky

Fundam. Informaticae, 2022

Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence.

Samson Abramsky

CoRR, 2022

Robin Milner's Work on Concurrency: An Appreciation.

Samson Abramsky

CoRR, 2022

Comonadic semantics for hybrid logic.

Samson Abramsky, Dan Marsden

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Discrete Density Comonads and Graph Parameters.

Samson Abramsky, Tomas Jakl, Thomas Paine

Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021

Relating structure and power: Comonadic semantics for computational resources.

Samson Abramsky, Nihil Shah

J. Log. Comput., 2021

Comonadic semantics for hybrid logic and bounded fragments.

Samson Abramsky, Dan Marsden

CoRR, 2021

On the Quantum-like Contextuality of Ambiguous Phrases.

Daphne Wang, Mehrnoosh Sadrzadeh, Samson Abramsky, Víctor H. Cervantes

CoRR, 2021

Comonadic semantics for guarded fragments.

Samson Abramsky, Dan Marsden

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

Arboreal Categories and Resources.

Samson Abramsky, Luca Reggio

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

The Logic of Contextuality.

Samson Abramsky, Rui Soares Barbosa

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Whither semantics?

Samson Abramsky

Theor. Comput. Sci., 2020

Dynamic game semantics.

Norihiro Yamada, Samson Abramsky

Math. Struct. Comput. Sci., 2020

Contextuality: At the Borders of Paradox.

Samson Abramsky

CoRR, 2020

Classical logic, classical probability, and quantum mechanics.

Samson Abramsky

CoRR, 2020

Relating Structure and Power: Extended Version.

Samson Abramsky, Nihil Shah

CoRR, 2020

2019

A comonadic view of simulation and quantum resources.

Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Game semantics for dependent types.

Matthijs Vákár, Radha Jagadeesan, Samson Abramsky

Inf. Comput., 2018

Relating Structure and Power: Comonadic Semantics for Computational Resources - Extended Abstract.

Samson Abramsky, Nihil Shah

Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017

Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting.

Samson Abramsky, Viktor Winschel

Math. Struct. Comput. Sci., 2017

A complete characterisation of All-versus-Nothing arguments for stabiliser states.

Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Simon Perdrix

CoRR, 2017

Intensionality, Definability and Computation.

Samson Abramsky

CoRR, 2017

Minimum Quantum Resources for Strong Non-Locality.

Samson Abramsky, Rui Soares Barbosa, Giovanni Carù, Nadish de Silva, Kohei Kishida, Shane Mansfield

Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

The Quantum Monad on Relational Structures.

Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

The pebbling comonad in Finite Model Theory.

Samson Abramsky, Anuj Dawar, Pengming Wang

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Hardy is (almost) everywhere: Nonlocality without inequalities for almost all entangled multipartite states.

Samson Abramsky, Carmen M. Constantin, Shenggang Ying

Inf. Comput., 2016

Dynamic Games and Strategies.

Norihiro Yamada, Samson Abramsky

CoRR, 2016

Anytime Inference in Valuation Algebras.

Abhishek Dasgupta, Samson Abramsky

CoRR, 2016

Possibilities Determine the Combinatorial Structure of Probability Polytopes.

Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield

CoRR, 2016

Information, Processes and Games.

Samson Abramsky

CoRR, 2016

Probabilistic Programs: Contextuality and Relational Database Theory.

Peter D. Bruza, Samson Abramsky

Proceedings of the Quantum Interaction - 10th International Conference, 2016

Introduction.

Samson Abramsky, Juha Kontinen, Jouko Väänänen, Heribert Vollmer

Proceedings of the Dependence Logic, Theory and Applications, 2016

2015

From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference.

Samson Abramsky, Jonathan A. Zvesper

J. Comput. Syst. Sci., 2015

Coalgebraic Semantics of Reflexive Economics (Dagstuhl Seminar 15042).

Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel

Dagstuhl Reports, 2015

DEMONIC programming: a computational language for single-particle equilibrium thermodynamics, and its formal semantics.

Samson Abramsky, Dominic Horsman

Proceedings of the Proceedings 12th International Workshop on Quantum Physics and Logic, 2015

Games for Dependent Types.

Samson Abramsky, Radha Jagadeesan, Matthijs Vákár

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Contextuality, Cohomology and Paradox.

Samson Abramsky, Rui Soares Barbosa, Kohei Kishida, Raymond Lal, Shane Mansfield

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Arrow's Theorem by Arrow Theory.

Samson Abramsky

Proceedings of the Logic Without Borders, 2015

2014

Events in context.

Samson Abramsky

Theor. Comput. Sci., 2014

Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity.

Samson Abramsky

Bull. EATCS, 2014

An Algebraic Characterisation of Concurrent Composition.

Samson Abramsky

CoRR, 2014

Two Puzzles About Computation.

Samson Abramsky

CoRR, 2014

Semantic Unification - A Sheaf Theoretic Approach to Natural Language.

Samson Abramsky, Mehrnoosh Sadrzadeh

Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

An Operational Interpretation of Negative Probabilities and No-Signalling Models.

Samson Abramsky, Adam Brandenburger

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

Intensionality, Definability and Computation.

Samson Abramsky

Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013

Relational Hidden Variables and Non-Locality.

Samson Abramsky

Stud Logica, 2013

Coalgebras, Chu Spaces, and Representations of Physical Systems.

Samson Abramsky

J. Philos. Log., 2013

Dependence Logic: Theory and Applications (Dagstuhl Seminar 13071).

Samson Abramsky, Juha Kontinen, Jouko A. Väänänen, Heribert Vollmer

Dagstuhl Reports, 2013

No-Signalling Is Equivalent To Free Choice of Measurements.

Samson Abramsky, Adam Brandenburger, Andrei Savochkin

Proceedings of the 10th International Workshop on Quantum Physics and Logic, 2013

A classification of multipartite states by degree of non-locality.

Samson Abramsky, Carmen M. Constantin

Proceedings of the 10th International Workshop on Quantum Physics and Logic, 2013

Semantics of Interaction.

Samson Abramsky

CoRR, 2013

Foreword.

Samson Abramsky, Dan R. Ghica

Ann. Pure Appl. Log., 2013

Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics.

Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis

Proceedings of the IJCAI 2013, 2013

Relational Databases and Bell's Theorem.

Samson Abramsky

Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012

Big toy models - Representing physical systems as Chu spaces.

Samson Abramsky

Synth., 2012

What Makes Alan Turing a Great Scientist? - Introduction to the Special Theme.

Gilles Dowek, Samson Abramsky

ERCIM News, 2012

Information Flow and Its Applications (Dagstuhl Seminar 12352).

Samson Abramsky, Jean Krivine, Michael W. Mislove

Dagstuhl Reports, 2012

Logical Bell Inequalities

Samson Abramsky, Lucien Hardy

CoRR, 2012

Heterotic Computing Examples with Optics, Bacteria, and Chemicals.

Susan Stepney, Samson Abramsky, Matthias Bechmann, Jerzy Gorecki, Viv Kendon, Thomas J. Naughton, Mario J. Pérez-Jiménez, Francisco José Romero-Campero, Angelika Sebald

Proceedings of the Unconventional Computation and Natural Computation, 2012

2011

Domain Theory and the Logic of Observable Properties

Samson Abramsky

CoRR, 2011

The Cohomology of Non-Locality and Contextuality

Samson Abramsky, Shane Mansfield, Rui Soares Barbosa

Proceedings of the Proceedings 8th International Workshop on Quantum Physics and Logic, 2011

From IF to BI: a tale of dependence and separation

Samson Abramsky, Jouko A. Väänänen

CoRR, 2011

Introduction to Categories and Categorical Logic

Samson Abramsky, Nikos Tzevelekos

CoRR, 2011

A Unified Sheaf-Theoretic Account Of Non-Locality and Contextuality

Samson Abramsky, Adam Brandenburger

CoRR, 2011

The Logic and Topology of Non-locality and Contextuality.

Samson Abramsky

Proceedings of the Unconventional Computation - 10th International Conference, 2011

2010

Robin Milner's Work on Concurrency.

Samson Abramsky

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

From CSP to Game Semantics.

Samson Abramsky

Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009

Logic and Geometry of Agents in Agent-Based Modeling.

Samson Abramsky

Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

From IF to BI.

Samson Abramsky, Jouko A. Väänänen

Synth., 2009

Preface.

Samson Abramsky, Michael W. Mislove, Catuscia Palamidessi

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Game Semantics for Access Control.

Samson Abramsky, Radha Jagadeesan

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Abstract Physical Traces

Samson Abramsky, Bob Coecke

CoRR, 2009

Games, Interaction and Computation.

Samson Abramsky

Proceedings of the Perspectives of Systems Informatics, 2009

2008

Types, Orthogonality and Genericity: Some Tools for Communicating Process Architectures.

Samson Abramsky

Proceedings of the thirty-first Communicating Process Architectures Conference, 2008

Grand Challenge 7: Journeys in Non-Classical Computation.

Susan Stepney, Samson Abramsky, Andy Adamatzky, Colin G. Johnson, Jon Timmis

Proceedings of the Visions of Computer Science, 2008

2007

Physics from Computer Science: a Position Statement.

Samson Abramsky, Bob Coecke

Int. J. Unconv. Comput., 2007

Event Domains, Stable Functions and Proof-Nets.

Samson Abramsky

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract).

Samson Abramsky

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Petri Nets, Discrete Physics, and Distributed Quantum Computation.

Samson Abramsky

Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006

A categorical quantum logic.

Samson Abramsky, Ross Duncan

Math. Struct. Comput. Sci., 2006

The Ackermann Award 2006.

Samson Abramsky, Erich Grädel, Johann A. Makowsky

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005

Game Theory Meets Theoretical Computer Science.

Samson Abramsky, Marios Mavronicolas

Theor. Comput. Sci., 2005

A structural approach to reversible computation.

Samson Abramsky

Theor. Comput. Sci., 2005

What are the Fundamental Structures of Concurrency?: We still don't know!

Samson Abramsky

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Linear realizability and full completeness for typed lambda-calculi.

Samson Abramsky, Marina Lenisa

Ann. Pure Appl. Log., 2005

A game semantics for generic polymorphism.

Samson Abramsky, Radha Jagadeesan

Ann. Pure Appl. Log., 2005

Algorithmic Game Semantics and Static Analysis.

Samson Abramsky

Proceedings of the Static Analysis, 12th International Symposium, 2005

Discrete classical vs. continuous quantum data in abstract quantum mechanics.

Samson Abramsky, Bob Coecke

Proceedings of the Spatial Representation: Discrete vs. Continuous Computational Models, 2005

Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories.

Samson Abramsky

Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

A Cook's Tour of the Finitary Non-Well-Founded Sets.

Samson Abramsky

Proceedings of the We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, 2005

2004

Applying Game Semantics to Compositional Software Modeling and Verification.

Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Nominal Games and Full Abstraction for the Nu-Calculus.

Samson Abramsky, Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong, Ian David Bede Stark

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

A Categorical Semantics of Quantum Protocols.

Samson Abramsky, Bob Coecke

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

High-Level Methods for Quantum Computation and Information.

Samson Abramsky

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

Sequentiality vs. Concurrency In Games And Logic.

Samson Abramsky

Math. Struct. Comput. Sci., 2003

2002

Geometry of Interaction and Linear Combinatory Algebras.

Samson Abramsky, Esfandiar Haghverdi, Philip J. Scott

Math. Struct. Comput. Sci., 2002

Physical Traces: Quantum vs. Classical Information Processing.

Samson Abramsky, Bob Coecke

Proceedings of the Category Theory and Computer Science, 2002

2001

A fully abstract denotational semantics for the calculus of higher-order communicating systems.

Bent Thomsen, Samson Abramsky

Theor. Comput. Sci., 2001

Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218.

Samson Abramsky, Luca Aceto, Anna Ingólfsdóttir

Inf. Comput., 2001

Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus.

Samson Abramsky, Marina Lenisa

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Full Abstraction for PCF.

Samson Abramsky, Radha Jagadeesan, Pasquale Malacaria

Inf. Comput., 2000

Axiomatizing Fully Complete Models for ML Polymorphic Types.

Samson Abramsky, Marina Lenisa

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Game Semantics: Achievements and Prospects.

Samson Abramsky

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A Fully Complete PER Model for ML Polymorphic Types.

Samson Abramsky, Marina Lenisa

Proceedings of the Computer Science Logic, 2000

Axioms for definability and full completeness.

Samson Abramsky

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

Handbook of logic in computer science. Volume 5. Logic and Algebraic Methods.

Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum

Clarendon Press, ISBN: 0198537816, 2000

1999

Full Abstraction for Idealized Algol with Passive Expressions.

Samson Abramsky, Guy McCusker

Theor. Comput. Sci., 1999

A Specification Structure for Deadlock-Freedom of Synchronous Processes.

Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan

Theor. Comput. Sci., 1999

Process Realizability.

Samson Abramsky

Proceedings of the Tutorial Workshop on Realizability Semantics and Applications, associated to FLoC'99, the 1999 Federated Logic Conference, Trento, Italy, June 30, 1999

Concurrent Games and Full Completeness.

Samson Abramsky, Paul-André Melliès

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

A Fully Abstract Game Semantics for General References.

Samson Abramsky, Kohei Honda, Guy McCusker

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems.

Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan

Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Game Semantics for Programming Languages (Abstract).

Samson Abramsky

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Specifying Interaction Categories.

Dusko Pavlovic, Samson Abramsky

Proceedings of the Category Theory and Computer Science, 7th International Conference, 1997

Call-by-Value Games.

Samson Abramsky, Guy McCusker

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions.

Samson Abramsky, Guy McCusker

Proceedings of the Linear Logic Tokyo Meeting 1996, Keio University, Mita Campus, Tokyo, Japan, March 29, 1996

Interaction categories and the foundations of typed concurrent programming.

Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan

Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996

Retracing Some Paths in Process Algebra.

Samson Abramsky

Proceedings of the CONCUR '96, 1996

Semantics of Interaction (Abstract).

Samson Abramsky

Proceedings of the Trees in Algebra and Programming, 1996

1995

Games and Full Abstraction for the Lazy lambda-Calculus

Samson Abramsky, Guy McCusker

Proceedings of the Proceedings, 1995

Specification Structures and Propositions-as-Types for Concurrency.

Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan

Proceedings of the Logics for Concurrency, 1995

Handbook of logic in computer science. Volume 4. Semantic modelling.

Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum

Clarendon Press, ISBN: 0198537808, 1995

1994

New Foundations for the Geometry of Interaction

Samson Abramsky, Radha Jagadeesan

Inf. Comput., May, 1994

Proofs as Processes.

Samson Abramsky

Theor. Comput. Sci., 1994

Games and Full Completeness for Multiplicative Linear Logic.

Samson Abramsky, Radha Jagadeesan

J. Symb. Log., 1994

Games for Recursive Types.

Samson Abramsky, Guy McCusker

Proceedings of the Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, 1994

Handbook of logic in computer science. Volume 3. Semantic Structures.

Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum

Clarendon Press, ISBN: 019853762X, 1994

1993

Full Abstraction in the Lazy Lambda Calculus

Samson Abramsky, C.-H. Luke Ong

Inf. Comput., August, 1993

Computational Interpretations of Linear Logic.

Samson Abramsky

Theor. Comput. Sci., 1993

Quantales, Observational Logic and Process Semantics.

Samson Abramsky, Steven Vickers

Math. Struct. Comput. Sci., 1993

An Integrated Engineering Study Scheme in Computing.

Anthony Finkelstein, Jeff Kramer, Samson Abramsky, Krysia Broda, Sophia Drossopoulou, Susan Eisenbach

Comput. J., 1993

An internal language for autonomous categories.

Ian Mackie, Leopoldo Román, Samson Abramsky

Appl. Categorical Struct., 1993

Interaction Categories.

Samson Abramsky

Proceedings of the Theory and Formal Methods 1993, 1993

1992

Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract).

Samson Abramsky, Radha Jagadeesan

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

Handbook of logic in computer science. Volume 2. Background: Computational structures.

Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum

Clarendon Press, ISBN: 0198537611, 1992

Handbook of logic in computer science. Volume 1. Background: Mathematical structures.

Samson Abramsky, Dov M. Gabbay, T. S. E. Maibaum

Clarendon Press, ISBN: 0198537352, 1992

1991

A Domain Equation for Bisimulation

Samson Abramsky

Inf. Comput., June, 1991

Domain Theory in Logical Form.

Samson Abramsky

Ann. Pure Appl. Log., 1991

A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions.

Samson Abramsky, Thomas P. Jensen

Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

1990

OOPSLA panel on object-based concurrent programming.

Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky

Proceedings of the Workshop on Object-based Concurrent Programming, 1990

Abstract Interpretation, Logical Relations and Kan Extensions.

Samson Abramsky

J. Log. Comput., 1990

Foundations of Concurrent Object-Oriented Programming (Panel).

Gul Agha, Samson Abramsky, Carl Hewitt, Robin Milner, Peter Wegner, Akinori Yonezawa

Proceedings of the Conference on Object-Oriented Programming Systems, 1990

Foundations of object-based concurrent programming (panel session).

Gul Agha, Akinori Yonezawa, Peter Wegner, Samson Abramsky

Proceedings of the European Conference on Object-Oriented Programming Addendum: Systems, 1990

1989

A Generalized Kahn Principle for Abstract Asynchronous Networks.

Samson Abramsky

Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Observational Logic and Process Semantics (Abstract).

Samson Abramsky

Proceedings of the Logic at Botik '89, 1989

1988

Mixed Computation of Prolog Programs.

David A. Fuller, Samson Abramsky

New Gener. Comput., 1988

1987

Observation Equivalence as a Testing Equivalence.

Samson Abramsky

Theor. Comput. Sci., 1987

1986

Strictness Analysis for Higher-Order Functions.

Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky

Sci. Comput. Program., 1986

1985

The theory of strictness analysis for higher order functions.

Geoffrey Livingston Burn, Chris Hankin, Samson Abramsky

Proceedings of the Programs as Data Objects, 1985

Strictness analysis and polymorphic invariance.

Samson Abramsky

Proceedings of the Programs as Data Objects, 1985

Secd-m: a Virtual Machine for Applicative Programming.

Samson Abramsky, R. Sykes

Proceedings of the Functional Programming Languages and Computer Architecture, 1985

Introduction.

Samson Abramsky

Proceedings of the Category Theory and Computer Programming, 1985

1983

On Semantic Foundations for Applicative Multiprogramming.

Samson Abramsky

Proceedings of the Automata, 1983

Experiments, Powerdomains and Fully Abstract Models for Applicative Multiprogramming.

Samson Abramsky

Proceedings of the Fundamentals of Computation Theory, 1983