Richard Kennaway

Orcid: 0000-0001-9702-644X

Affiliations:
  • University of East Anglia, Norwich, UK


According to our database1, Richard Kennaway authored at least 46 papers between 1980 and 2015.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
Avatar-independent scripting for real-time gesture animation.
CoRR, 2015

2014
Programs as visual, interactive documents.
Softw. Pract. Exp., 2014

2011
Generation of Diverse Biological Forms through Combinatorial Interactions between Tissue Polarity and Growth.
PLoS Comput. Biol., 2011

2008
Linguistic modelling and language-processing technologies for Avatar-based sign language presentation.
Univers. Access Inf. Soc., 2008

2007
Providing signed content on the Internet by synthesized animation.
ACM Trans. Comput. Hum. Interact., 2007

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

2003
Experience with and Requirements for a Gesture Description Language for Synthetic Animation.
Proceedings of the Gesture-Based Communication in Human-Computer Interaction, 2003

2002
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001
Synthetic Animation of Deaf Signing Gestures.
Proceedings of the Gesture and Sign Languages in Human-Computer Interaction, 2001

2000
Stable results and relative normalization.
J. Log. Comput., 2000

The development of language processing support for the ViSiCAST project.
Proceedings of the ACM Conference on Assistive Technologies, 2000

1999
Meaningless Terms in Rewriting.
J. Funct. Log. Program., 1999

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

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

1996
Event Structures and Non-Orthogonal Term Graph Rewriting.
Math. Struct. Comput. Sci., 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

Infinitary rewriting and cyclic graphs.
Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

Some properties of non-orthogonal term graph rewriting systems.
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

A Conflict Between Call-by-Need Computation and Parallelism.
Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

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

1990
Implementing Term Rewrite Languages in Dactl.
Theor. Comput. Sci., 1990

Graph Rewriting in Some Categories of Partial Morphisms.
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

The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems.
Proceedings of the ESOP'90, 1990

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

Sequential Evaluation Strategies for Parallel-Or and Related Reduction Systems.
Ann. Pure Appl. Log., 1989

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

On "On Graph Rewritings" (Corrigendum).
Theor. Comput. Sci., 1988

Implementing Term Rewritin Languages in Dactl.
Proceedings of the CAAP '88, 1988

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

On "On Graph Rewritings".
Theor. Comput. Sci., 1987

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

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


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

1980
A Theory of Nondeterminism.
Proceedings of the Automata, 1980


  Loading...