J.-Y. Girard (1987):
Linear Logic.
Theoretical Computer Science 50(1),
pp. 1–101.
G. Gonthier, J.-J. Lévy & P.-A. Melliès (1992):
An abstract standardisation theorem.
In: Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, 22-25 June 1992, Santa Cruz, California, USA.
IEEE Computer Society,
pp. 72–81.
G. Huet & J.-J. Lévy (1991):
Computations in orthogonal rewriting systems.
In: Jean-Louis Lassez & Gordon Plotkin: Computational Logic, Essays in Honor of Alan Robinson.
MIT Press,
pp. 394–443.
C.B. Jay & D. Kesner (2006):
Pure Pattern Calculus.
In: Peter Sestoft: European Symposium on Programming 3924,
LNCS.
Springer-Verlag,
pp. 100–114.
C.B. Jay & D. Kesner (2009):
First-class patterns.
Journal of Functional Programming 19(2),
pp. 191–225.
Ryo Kashima (2000):
A Proof of the Standardization Theorem in λ-Calculus.
Research Reports on Mathematical and Computing Sciences C-145.
Tokyo Institute of Technology.
J.W. Klop, V. van Oostrom & R.C. de Vrijer (2008):
Lambda calculus with patterns.
Theoretical Computer Science 398(1-3),
pp. 16–31.
Paul-André Melliès (1996):
Description Abstraite des Systèmes de Réécriture.
Ph.D. thesis.
Université Paris VII.
Luca Paolini & Simona Ronchi Della Rocca (2004):
Parametric parameter passing Lambda-calculus.
Information and Computation 189(1),
pp. 87–106.
G. Plotkin (1975):
Call-by-name, call-by-value and the Lambda-calculus.
Theoretical Computer Science 1(2),
pp. 125–159.
M. Takahashi (1995):
Parallel reductions in lambda-calculus.
Information and Computation 118(1),
pp. 120–127.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theoretical Computer Science 55.
Cambridge University Press.
eptcs@eptcs.org