M. Ronan Sleep

According to our database1, M. Ronan Sleep authored at least 34 papers between 1975 and 2005.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Infinitary Rewriting: From Syntax to Semantics.
Proceedings of the Processes, 2005

1997
Infinitary Lambda Calculus.
Theor. Comput. Sci., 1997

Dactl: an experimental graph rewriting language.
J. Program. Lang., 1997

1996
Comparing Curried and Uncurried Rewriting.
J. Symb. Comput., 1996

Lambda-Definable Term rewriting Systems.
Proceedings of the Concurrency and Parallelism, 1996

1995
Transfinite Reductions in Orthogonal Term Rewriting Systems
Inf. Comput., May, 1995

SEMAGRAPH: the theory and practice of term graph rewriting.
Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

Infinitary Lambda Calculi and Böhm Models.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Transformation of Orthogonal Term Rewriting Systems.
Proceedings of the Algorithms, 1995

1994
On the Adequacy of Graph Rewriting for Simulating Term Rewriting.
ACM Trans. Program. Lang. Syst., 1994

Syntactic Definitions of Undefined: On Defining the Undefined.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1991
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract).
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Applications of Graph Grammars and Directions for Research.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

Dactl: An Experimental Graph Rewriting Language.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
LEAN: an intermediate language based on graph rewriting.
Parallel Comput., 1989

Graph Rewriting as a Computational Model.
Proceedings of the Concurrency: Theory, 1989

1988
Director Strings as Combinators.
ACM Trans. Program. Lang. Syst., 1988

Transputers + virtual tree kernel = real speedups.
Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988

1987
Needed Reduction and Spine Strategies for the Lambda Calculus
Inf. Comput., December, 1987

Variable Abstraction in O(n log n) Space.
Inf. Process. Lett., 1987

Transputer-Based Experiments with the ZAPP Architecture.
Proceedings of the PARLE, 1987

Towards an Intermediate Language based on Graph Rewriting.
Proceedings of the PARLE, 1987


1986
Applicative Caching.
ACM Trans. Program. Lang. Syst., 1986

1983
Novel architectures for declarative languages.
Softw. Microsystems, 1983

Syntax and informal semantics of DyNe, a parallel language.
Proceedings of the Analysis of Concurrent Systems, 1983

1982
Expressions as Processes.
Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, 1982

Parallel implementation of functional languages.
Proceedings of the International Conference on Parallel Processing, 1982

Applicative Objects as Processes.
Proceedings of the Proceedings of the 3rd International Conference on Distributed Computing Systems, 1982

1981
Towards a Zero Assignment Parallel Processor.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

Executing functional programs on a virtual tree of processors.
Proceedings of the 1981 conference on Functional programming languages and computer architecture, 1981

1980
Uniform Random Generation of Balanced Parenthesis Strings.
ACM Trans. Program. Lang. Syst., 1980

1975
The extraction of heuristic information from a special class of state space representations.
PhD thesis, 1975


  Loading...