default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Maraist
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c11]Todd W. Neller, Nathan Sprague, John Maraist, Lisa Zhang, Pouria Fewzee, Duri Long, Jonathan Moon, Brian Magerko, Alex Leto, Toni Lefton, Tom Williams:
Model AI Assignments 2021. AAAI 2021: 15705-15706
2010 – 2019
- 2017
- [c10]John Maraist:
String Shuffling over a Gap between Parsing and Plan Recognition. AAAI Workshops 2017 - 2016
- [i1]John Maraist:
Generalized LR parsing and the shuffle operator. CoRR abs/1611.05831 (2016) - 2012
- [c9]Mark H. Burstein, Robert P. Goldman, Paul Robertson, Robert Laddaga, Robert Balzer, Neil M. Goldman, Christopher W. Geib, Ugur Kuter, David D. McDonald, John Maraist, Peter Keller, David S. Wile:
STRATUS: Strategic and Tactical Resiliency against Threats to Ubiquitous Systems. SASO Workshops 2012: 47-54 - 2010
- [c8]Robert P. Goldman, John Maraist:
Shopper: A System for Executing and Simulating Expressive Plans. ICAPS 2010: 230-233 - [c7]John Maraist:
NST: a unit testing system for common Lisp. ILC 2010: 53-64
2000 – 2009
- 2009
- [c6]J. Thomas Haigh, Steven A. Harp, Richard C. O'Brien, Charles N. Payne, Johnathan Gohde, John Maraist:
Trapping Malicious Insiders in the SPDR Web. HICSS 2009: 1-10 - 2008
- [c5]Christopher W. Geib, John Maraist, Robert P. Goldman:
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting. ICAPS 2008: 91-98
1990 – 1999
- 1999
- [j2]John Maraist, Martin Odersky, David N. Turner, Philip Wadler:
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus. Theor. Comput. Sci. 228(1-2): 175-210 (1999) - 1998
- [j1]John Maraist, Martin Odersky, Philip Wadler:
The Call-by-Need Lambda Calculus. J. Funct. Program. 8(3): 275-317 (1998) - [c4]John Maraist:
Separating Weakening and Contraction in a Linear Lambda Calculus. CATS 1998: 151-166 - 1997
- [b1]John Maraist:
Comparing reduction strategies in resource-conscious lambda calculi. Universität Karlsruhe, 1997, pp. I-XII, 1-210 - 1995
- [c3]Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler:
The Call-by-Need Lambda Calculus. POPL 1995: 233-246 - [c2]John Maraist, Martin Odersky, David N. Turner, Philip Wadler:
Call-by-name, call-by-value, call-by-need and the linear lambda calculus. MFPS 1995: 370-392 - 1994
- [c1]John Maraist, Frank S. K. Silbermann:
A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic Languages. PLILP 1994: 355-369
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
