John Maraist

According to our database1, John Maraist authored at least 14 papers between 1994 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
String Shuffling over a Gap between Parsing and Plan Recognition.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Generalized LR parsing and the shuffle operator.
CoRR, 2016

2012
STRATUS: Strategic and Tactical Resiliency against Threats to Ubiquitous Systems.
Proceedings of the Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops, 2012

2010
NST: a unit testing system for common Lisp.
Proceedings of the International Lisp Conference, 2010

Shopper: A System for Executing and Simulating Expressive Plans.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
Trapping Malicious Insiders in the SPDR Web.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

1999
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci., 1999

1998
The Call-by-Need Lambda Calculus.
J. Funct. Program., 1998

Separating Weakening and Contraction in a Linear Lambda Calculus.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
Comparing reduction strategies in resource-conscious lambda calculi.
PhD thesis, 1997

1995
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci., 1995

The Call-by-Need Lambda Calculus.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

1994
A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic Languages.
Proceedings of the Programming Language Implementation and Logic Programming, 1994


  Loading...