Kiselyov, Oleg Many more predecessors: a representation workout. (English) Zbl 1444.03018 J. Funct. Program. 30, Paper No. e7, 13 p. (2020). MSC: 03B40 PDF BibTeX XML Cite \textit{O. Kiselyov}, J. Funct. Program. 30, Paper No. e7, 13 p. (2020; Zbl 1444.03018) Full Text: DOI OpenURL
García-Pérez, Álvaro; Nogueira, Pablo The full-reducing krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus. (English) Zbl 07135413 J. Funct. Program. 29, Paper No. e7, 38 p. (2019). MSC: 68N18 PDF BibTeX XML Cite \textit{Á. García-Pérez} and \textit{P. Nogueira}, J. Funct. Program. 29, Paper No. e7, 38 p. (2019; Zbl 07135413) Full Text: DOI OpenURL
Raja, N.; Shyamasundar, R. K. A closer look at constraints as processes. (English) Zbl 1187.68166 Inf. Process. Lett. 98, No. 5, 206-210 (2006). MSC: 68N99 PDF BibTeX XML Cite \textit{N. Raja} and \textit{R. K. Shyamasundar}, Inf. Process. Lett. 98, No. 5, 206--210 (2006; Zbl 1187.68166) Full Text: DOI OpenURL
Schmidt-Schauß, Manfred; Schulz, Klaus U. Decidability of bounded higher-order unification. (English) Zbl 1126.03017 J. Symb. Comput. 40, No. 2, 905-954 (2005). MSC: 03B25 03B40 68W30 PDF BibTeX XML Cite \textit{M. Schmidt-Schauß} and \textit{K. U. Schulz}, J. Symb. Comput. 40, No. 2, 905--954 (2005; Zbl 1126.03017) Full Text: DOI Link OpenURL
Goldberg, Mayer A variadic extension of Curry’s fixed-point combinator. (English) Zbl 1083.68015 High.-Order Symb. Comput. 18, No. 3-4, 371-388 (2005). MSC: 68N15 68N18 PDF BibTeX XML Cite \textit{M. Goldberg}, High.-Order Symb. Comput. 18, No. 3--4, 371--388 (2005; Zbl 1083.68015) Full Text: DOI OpenURL
Oles, Frank J. Precedence-inclusion patterns and relational learning. (English) Zbl 1077.68093 Theor. Comput. Sci. 342, No. 2-3, 262-315 (2005). MSC: 68T10 68T05 PDF BibTeX XML Cite \textit{F. J. Oles}, Theor. Comput. Sci. 342, No. 2--3, 262--315 (2005; Zbl 1077.68093) Full Text: DOI OpenURL
Kahle, Reinhard Proof-theoretic notions for software maintenance. (English) Zbl 1264.68059 Seda, Anthony (ed.) et al., MFCSIT2000. Proceedings of the first Irish conference on the mathematical foundations of computer science and information technology, National University of Ireland, Cork, Ireland, July 20–21, 2000. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 40, 206-219 (2001). MSC: 68N30 PDF BibTeX XML Cite \textit{R. Kahle}, Electron. Notes Theor. Comput. Sci. 40, 206--219 (2001; Zbl 1264.68059) Full Text: DOI OpenURL
Kfoury, A. J.; Ronchi della Rocca, S.; Tiuryn, J.; Urzyczyn, P. Alpha-conversion and typability. (English) Zbl 1004.03005 Inf. Comput. 150, No. 1, 1-21 (1999). MSC: 03B40 68N18 PDF BibTeX XML Cite \textit{A. J. Kfoury} et al., Inf. Comput. 150, No. 1, 1--21 (1999; Zbl 1004.03005) Full Text: DOI OpenURL
Tendeau, Frédéric Computing abstract decorations of parse forests using dynamic programming and algebraic power series. (English) Zbl 0902.68112 Theor. Comput. Sci. 199, No. 1-2, 145-166 (1998). MSC: 68N20 90C39 PDF BibTeX XML Cite \textit{F. Tendeau}, Theor. Comput. Sci. 199, No. 1--2, 145--166 (1998; Zbl 0902.68112) Full Text: DOI OpenURL
Jouannaud, Jean-Pierre; Okada, Mitsuhiro Abstract data type systems. (English) Zbl 0901.68121 Theor. Comput. Sci. 173, No. 2, 349-391 (1997). MSC: 68Q65 PDF BibTeX XML Cite \textit{J.-P. Jouannaud} and \textit{M. Okada}, Theor. Comput. Sci. 173, No. 2, 349--391 (1997; Zbl 0901.68121) Full Text: DOI OpenURL
Pigozzi, Don; Salibra, Antonino Lambda abstraction algebras: representation theorems. (English) Zbl 0874.68188 Theor. Comput. Sci. 140, No. 1, 5-52 (1995). MSC: 68Q55 PDF BibTeX XML Cite \textit{D. Pigozzi} and \textit{A. Salibra}, Theor. Comput. Sci. 140, No. 1, 5--52 (1995; Zbl 0874.68188) Full Text: DOI OpenURL
Klop, Jan Willem; van Oostrom, Vincent; van Raamsdonk, Femke Combinatory reduction systems: Introduction and survey. (English) Zbl 0796.03024 Theor. Comput. Sci. 121, No. 1-2, 279-308 (1993). Reviewer: R.David (Chambéry) MSC: 03B40 68Q42 PDF BibTeX XML Cite \textit{J. W. Klop} et al., Theor. Comput. Sci. 121, No. 1--2, 279--308 (1993; Zbl 0796.03024) Full Text: DOI Link OpenURL
Plotkin, G. D. Call-by-name, call-by-value and the \(\lambda\)-calculus. (English) Zbl 0325.68006 Theor. Comput. Sci. 1, 125-159 (1975). MSC: 68N01 03B40 PDF BibTeX XML Cite \textit{G. D. Plotkin}, Theor. Comput. Sci. 1, 125--159 (1975; Zbl 0325.68006) Full Text: DOI OpenURL