Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Balabonski, Thibaut
2010.
Optimality for dynamic patterns.
p.
231.
Given-Wilson, Thomas
Gorla, Daniele
and
Jay, Barry
2010.
Theoretical Computer Science.
Vol. 323,
Issue. ,
p.
244.
Kesner, Delia
Lombardi, Carlos
and
Ríos, Alejandro
2011.
A standardisation proof for algebraic pattern calculi.
Electronic Proceedings in Theoretical Computer Science,
Vol. 49,
Issue. ,
p.
58.
Jay, Barry
and
Given-Wilson, Thomas
2011.
A combinatory account of internal structure.
The Journal of Symbolic Logic,
Vol. 76,
Issue. 3,
p.
807.
Guenot, Nicolas
2011.
Nested proof search as reduction in the Lambda-calculus.
p.
183.
Jay, Barry
and
Palsberg, Jens
2011.
Typed self-interpretation by pattern matching.
p.
247.
Jay, Barry
and
Palsberg, Jens
2011.
Typed self-interpretation by pattern matching.
ACM SIGPLAN Notices,
Vol. 46,
Issue. 9,
p.
247.
Balabonski, Thibaut
2011.
On the Implementation of Dynamic Patterns.
Electronic Proceedings in Theoretical Computer Science,
Vol. 49,
Issue. ,
p.
16.
Bloom, Bard
and
Hirzel, Martin J.
2012.
Robust scripting via patterns.
p.
29.
Clouston, Ranald
2013.
Foundations of Software Science and Computation Structures.
Vol. 7794,
Issue. ,
p.
434.
Bloom, Bard
and
Hirzel, Martin J.
2013.
Robust scripting via patterns.
ACM SIGPLAN Notices,
Vol. 48,
Issue. 2,
p.
29.
Jay, Barry
and
Vergara, Jose
2013.
Growing a Language in Pattern Calculus.
p.
233.
Given-Wilson, Thomas
Huang, Freeman
and
Jay, Barry
2013.
Multi-polymorphic programming in bondi.
p.
53.
Solodkyy, Yuriy
Dos Reis, Gabriel
and
Stroustrup, Bjarne
2013.
Open pattern matching for C++.
p.
33.
Bucciarelli, Antonio
Kesner, Delia
and
Ronchi Della Rocca, Simona
2014.
Advanced Information Systems Engineering.
Vol. 7908,
Issue. ,
p.
341.
Given-Wilson, Thomas
2014.
Theoretical Aspects of Computing – ICTAC 2014.
Vol. 8687,
Issue. ,
p.
206.
Solodkyy, Yuriy
Dos Reis, Gabriel
and
Stroustrup, Bjarne
2014.
Open pattern matching for C++.
ACM SIGPLAN Notices,
Vol. 49,
Issue. 3,
p.
33.
Blanqui, Frédéric
2016.
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility.
Theoretical Computer Science,
Vol. 611,
Issue. ,
p.
50.
Jay, Barry
2016.
Programs as Data Structures in λSF-Calculus.
Electronic Notes in Theoretical Computer Science,
Vol. 325,
Issue. ,
p.
221.
Viso, Andrés
Bonelli, Eduardo
and
Ayala-Rincón, Mauricio
2016.
Type Soundness for Path Polymorphism.
Electronic Notes in Theoretical Computer Science,
Vol. 323,
Issue. ,
p.
235.
Discussions
No Discussions have been published for this article.