|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 22 occurrences of 20 keywords
|
|
|
Results
Found 35 publication records. Showing 35 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
56 | Andrew M. Pitts, Mark R. Shinwell |
Generative unbinding of names. |
POPL |
2007 |
DBLP DOI BibTeX RDF |
alpha-conversion, meta-programming, abstract syntax, binders |
34 | Andrew M. Pitts |
A Fresh Approach to Representing Syntax with Static Binders in Functional Programming. |
ICFP |
2001 |
DBLP DOI BibTeX RDF |
|
28 | James Cheney |
Scrap your nameplate: (functional pearl). |
ICFP |
2005 |
DBLP DOI BibTeX RDF |
generic programming, binding, names, substitution |
28 | Donald D. Chamberlin, Morton M. Astrahan, W. Frank King III, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, Bradford W. Wade, Robert A. Yost |
Support for Repetitive Transactions and Ad Hoc Queries in System R. |
ACM Trans. Database Syst. |
1981 |
DBLP DOI BibTeX RDF |
System R, compilation, query languages, performance measurements, transaction processing, relational database systems |
28 | Murdoch Gabbay, Andrew M. Pitts |
A New Approach to Abstract Syntax Involving Binders. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
permutation models, set theory, binding, abstract syntax |
27 | Amy P. Felty, Alberto Momigliano |
Reasoning with hypothetical judgments and open terms in hybrid. |
PPDP |
2009 |
DBLP DOI BibTeX RDF |
name-binding, induction, logical frameworks, higher-order abstract syntax, interactive theorem proving |
27 | James Cheney, Christian Urban |
Nominal logic programming. |
ACM Trans. Program. Lang. Syst. |
2008 |
DBLP DOI BibTeX RDF |
name-binding, semantics, logic programming, Nominal logic |
20 | Yue Ju, Yixuan Tang, Jinpeng Lan, Xiangbo Mi, Jingxuan Zhang |
A Cross-Language Name Binding Recognition and Discrimination Approach for Identifiers. |
SANER |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Alimujiang Yasen, Kazunori Ueda |
Name Binding is Easy with Hypergraphs. |
IEICE Trans. Inf. Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
20 | Kazuhiro Ichikawa, Shigeru Chiba |
User-Defined Operators Including Name Binding for New Language Constructs. |
Art Sci. Eng. Program. |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Kazuhiro Ichikawa, Shigeru Chiba |
User-Defined Operators Including Name Binding for New Language Constructs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
20 | Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann |
Nominal Automata with Name Binding. |
FoSSaCS |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Lutz Schröder, Dexter Kozen, Stefan Milius, Thorsten Wißmann |
Nominal Automata with Name Binding. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
20 | Larisse Voufo, Marcin Zalewski, Andrew Lumsdaine |
Scoping rules on a platter: a framework for understanding and specifying name binding. |
WGP@ICFP |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Stuart Cheshire, Marc Krochmal |
Requirements for a Protocol to Replace the AppleTalk Name Binding Protocol (NBP). |
RFC |
2013 |
DBLP DOI BibTeX RDF |
|
20 | Fernando Rosa-Velardo, María Martos-Salgado |
Multiset rewriting for the verification of depth-bounded processes with name binding. |
Inf. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Gabriël D. P. Konat, Lennart C. L. Kats, Guido Wachsmuth, Eelco Visser |
Declarative Name Binding and Scope Rules. |
SLE |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Gabriël D. P. Konat, Vlad A. Vergu, Lennart C. L. Kats, Guido Wachsmuth, Eelco Visser |
The spoofax name binding language. |
SPLASH |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Maartje de Jonge, Eelco Visser |
A language generic solution for name binding preservation in refactorings. |
LDTA |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Fernando Rosa-Velardo |
Depth Boundedness in Multiset Rewriting Systems with Name Binding. |
RP |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Fernando Rosa-Velardo |
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding. |
WRLA |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Michele Boreale, Maria Grazia Buscemi, Ugo Montanari |
A General Name Binding Mechanism. |
TGC |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Matthew R. Lakin, Andrew M. Pitts |
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming. |
ESOP |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Jordi Levy, Mateu Villaret |
Nominal Unification from a Higher-Order Perspective. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Andrew M. Pitts |
Alpha-Structural Recursion and Induction. |
TPHOLs |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Yingfei Dong, Changho Choi, Zhi-Li Zhang |
Secure Name Service: A Framework for Protecting Critical Internet Resources. |
NETWORKING |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Silvia Crafa, Daniele Varacca, Nobuko Yoshida |
Compositional Event Structure Semantics for the Internal pi -Calculus. |
CONCUR |
2007 |
DBLP DOI BibTeX RDF |
|
11 | Jim Laird |
A Game Semantics of the Asynchronous pi-Calculus. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
11 | Raymond R. Devillers, Hanna Klaudel, Maciej Koutny |
Petri Net Semantics of the Finite pi-Calculus. |
FORTE |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Ulrich Schöpp, Ian Stark |
A Dependent Type Theory with Names and Binding. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
|
11 | Amin Vahdat, Alvin R. Lebeck, Carla Schlatter Ellis |
Every joule is precious: the case for revisiting operating system design for energy efficiency. |
ACM SIGOPS European Workshop |
2000 |
DBLP DOI BibTeX RDF |
|
11 | David M. Goldschlag, Stuart G. Stubblebine |
Publicly Verifiable Lotteries: Applications of Delaying Functions. |
Financial Cryptography |
1998 |
DBLP DOI BibTeX RDF |
|
11 | Peter Sewell |
From Rewrite to Bisimulation Congruences. |
CONCUR |
1998 |
DBLP DOI BibTeX RDF |
|
11 | Daniel J. Salomon |
Using Partial Evaluation in Support of Portability, Reusability, and Maintainability. |
CC |
1996 |
DBLP DOI BibTeX RDF |
|
11 | Frank Pfenning, Conal Elliott |
Higher-Order Abstract Syntax. |
PLDI |
1988 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #35 of 35 (100 per page; Change: )
|
|