Sannella, Donald; Fourman, Michael; Peng, Haoran; Wadler, Philip Introduction to computation. Haskell, logic and automata. (English) Zbl 1497.68005 Undergraduate Topics in Computer Science. Cham: Springer (ISBN 978-3-030-76907-9/pbk; 978-3-030-76908-6/ebook). xvi, 366 p. (2021). Reviewer: Dieter Riebesehl (Lüneburg) MSC: 68-01 03-01 03B70 68N15 68N18 68Q45 PDFBibTeX XMLCite \textit{D. Sannella} et al., Introduction to computation. Haskell, logic and automata. Cham: Springer (2021; Zbl 1497.68005) Full Text: DOI
Berghammer, Rudolf; Schmidt, Gunther; Winter, Michael Cryptomorphic topological structures: a computational, relation-algebraic approach. (English) Zbl 1452.03139 J. Log. Algebr. Methods Program. 102, 17-45 (2019). MSC: 03G15 54A05 68W30 PDFBibTeX XMLCite \textit{R. Berghammer} et al., J. Log. Algebr. Methods Program. 102, 17--45 (2019; Zbl 1452.03139) Full Text: DOI
Farmer, William M. Incorporating quotation and evaluation into Church’s type theory. (English) Zbl 1390.68168 Inf. Comput. 260, 9-50 (2018). MSC: 68N18 03B40 PDFBibTeX XMLCite \textit{W. M. Farmer}, Inf. Comput. 260, 9--50 (2018; Zbl 1390.68168) Full Text: DOI arXiv
Hansen, Michael R.; Phan, Anh-Dung; Brekling, Aske W. A practical approach to model checking duration calculus using Presburger arithmetic. (English) Zbl 1315.68180 Ann. Math. Artif. Intell. 71, No. 1-3, 251-278 (2014). MSC: 68Q60 03B44 03B70 03F30 68W30 PDFBibTeX XMLCite \textit{M. R. Hansen} et al., Ann. Math. Artif. Intell. 71, No. 1--3, 251--278 (2014; Zbl 1315.68180) Full Text: DOI
Bullynck, Maarten Erhard Weigel’s contributions to the formation of symbolic logic. (English) Zbl 1329.01022 Hist. Philos. Log. 34, No. 1, 25-34 (2013). Reviewer: Stefan Neuwirth (Besançon) MSC: 01A45 03-03 PDFBibTeX XMLCite \textit{M. Bullynck}, Hist. Philos. Log. 34, No. 1, 25--34 (2013; Zbl 1329.01022) Full Text: DOI
Legris, Javier Paul Hertz and the origins of structural reasoning. (English) Zbl 1291.03005 Béziau, Jean-Yves (ed.), Universal logic: An anthology. From Paul Hertz to Dov Gabbay. Basel: Birkhäuser (ISBN 978-3-0346-0144-3/pbk; 978-3-0346-0145-0/ebook). Studies in Universal Logic, 3-10 (2012). MSC: 03-03 03B22 03B47 03F03 03F07 03A05 PDFBibTeX XMLCite \textit{J. Legris}, in: Universal logic: An anthology. From Paul Hertz to Dov Gabbay. Basel: Birkhäuser. 3--10 (2012; Zbl 1291.03005)
Berghammer, Rudolf A functional, successor list based version of Warshall’s algorithm with applications. (English) Zbl 1329.68303 de Swart, Harrie (ed.), Relational and algebraic methods in computer science. 12th international conference, RAMICS 2011, Rotterdam, The Netherlands, May 30 – June 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21069-3/pbk). Lecture Notes in Computer Science 6663, 109-124 (2011). MSC: 68W30 03G15 68N18 PDFBibTeX XMLCite \textit{R. Berghammer}, Lect. Notes Comput. Sci. 6663, 109--124 (2011; Zbl 1329.68303) Full Text: DOI
Ben-Sasson, Eli; Impagliazzo, Russell Random CNF’s are hard for the polynomial calculus. (English) Zbl 1216.03064 Comput. Complexity 19, No. 4, 501-519 (2010). MSC: 03F20 03B05 68Q17 68W30 PDFBibTeX XMLCite \textit{E. Ben-Sasson} and \textit{R. Impagliazzo}, Comput. Complexity 19, No. 4, 501--519 (2010; Zbl 1216.03064) Full Text: DOI
Mirasyedioğlu, Şeref; Güyer, Tolga A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG. (English) Zbl 1095.68751 Appl. Math. Comput. 176, No. 1, 65-75 (2006). MSC: 68W30 03B40 68N17 68Q05 68Q42 PDFBibTeX XMLCite \textit{Ş. Mirasyedioğlu} and \textit{T. Güyer}, Appl. Math. Comput. 176, No. 1, 65--75 (2006; Zbl 1095.68751) Full Text: DOI Link
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 PDFBibTeX XMLCite \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
Sato, Masahiko A simple theory of expressions, judgments and derivations. (English) Zbl 1115.68515 Maher, Michael J. (ed.), Advances in computer science – ASIAN 2004. Higher-level decision making. 9th Asian computing science conference. Dedicated to Jean-Louis Lassez on the occasion of his 5th cycle birthday, Chiang Mai, Thailand, December 8–10, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24087-X/pbk). Lecture Notes in Computer Science 3321, 437-451 (2004). MSC: 68T27 03B30 03B40 68T15 68W30 PDFBibTeX XMLCite \textit{M. Sato}, Lect. Notes Comput. Sci. 3321, 437--451 (2004; Zbl 1115.68515) Full Text: DOI
Leivant, Daniel Intrinsic reasoning about functional programs. I: First order theories. (English) Zbl 0992.03037 Ann. Pure Appl. Logic 114, No. 1-3, 117-153 (2002). MSC: 03B70 68N18 03F05 03F20 03F30 03D15 68Q15 68W30 PDFBibTeX XMLCite \textit{D. Leivant}, Ann. Pure Appl. Logic 114, No. 1--3, 117--153 (2002; Zbl 0992.03037) Full Text: DOI
Buss, Sam; Grigoriev, Dima; Impagliazzo, Russell; Pitassi, Toniann Linear gaps between degrees for the polynomial calculus modulo distinct primes. (English) Zbl 1007.03052 J. Comput. Syst. Sci. 62, No. 2, 267-289 (2001). MSC: 03F20 68Q17 68Q25 68W30 PDFBibTeX XMLCite \textit{S. Buss} et al., J. Comput. Syst. Sci. 62, No. 2, 267--289 (2001; Zbl 1007.03052) Full Text: DOI
Ayari, Abdelwaheb; Basin, David A higher-order interpretation of deductive tableau. (English) Zbl 0972.68509 J. Symb. Comput. 31, No. 5, 487-520 (2001). MSC: 68N18 03B35 68T15 68W30 PDFBibTeX XMLCite \textit{A. Ayari} and \textit{D. Basin}, J. Symb. Comput. 31, No. 5, 487--520 (2001; Zbl 0972.68509) Full Text: DOI Link
Impagliazzo, Russell; Pudlák, Pavel; Sgall, Jiří Lower bounds for the polynomial calculus and the Gröbner basis algorithm. (English) Zbl 0946.68129 Comput. Complexity 8, No. 2, 127-144 (1999). MSC: 68T15 68Q05 03B05 68W30 PDFBibTeX XMLCite \textit{R. Impagliazzo} et al., Comput. Complexity 8, No. 2, 127--144 (1999; Zbl 0946.68129) Full Text: DOI
Kupferman, Orna; Vardi, Moshe Y. The weakness of self-complementation. (English) Zbl 0924.03045 Meinel, Christoph (ed.) et al., STACS 99. 16th annual symposium on Theoretical aspects of computer science, Trier, Germany, March 4–6, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1563, 455-466 (1999). MSC: 03B70 68Q60 03D05 03B45 PDFBibTeX XMLCite \textit{O. Kupferman} and \textit{M. Y. Vardi}, Lect. Notes Comput. Sci. 1563, 455--466 (1999; Zbl 0924.03045)
Li, Zhoujun; Chen, Huowang Checking strong/weak bisimulation equivalences and observation congruence for the \(\pi\)-calculus. (Extended abstract). (English) Zbl 0913.03037 Larsen, Kim G. (ed.) et al., Automata, languages and programming. 25th international colloquium, ICALP ’98. Aalborg, Denmark, July 13–17, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1443, 707-718 (1998). Reviewer: D.Gruska (Bratislava) MSC: 03B70 68Q60 PDFBibTeX XMLCite \textit{Z. Li} and \textit{H. Chen}, Lect. Notes Comput. Sci. 1443, 707--718 (1998; Zbl 0913.03037)
Aguzzoli, Stefano The complexity of McNaughton functions of one variable. (English) Zbl 0911.03004 Adv. Appl. Math. 21, No. 1, 58-77 (1998). Reviewer: D.Mundici (Milano) MSC: 03B35 03B50 68W30 68T15 PDFBibTeX XMLCite \textit{S. Aguzzoli}, Adv. Appl. Math. 21, No. 1, 58--77 (1998; Zbl 0911.03004) Full Text: DOI
Kerber, Manfred; Kohlhase, Michael A tableau claculus for partial functions. (English) Zbl 0851.03004 Collegium logicum. Annals of the Kurt Gödel Society. Volume 2. Wien: Springer-Verlag. 21-49 (1996). Reviewer: N.Curteanu (Iaşi) MSC: 03B50 03B35 68T15 68W30 68N17 PDFBibTeX XMLCite \textit{M. Kerber} and \textit{M. Kohlhase}, in: Collegium logicum. Annals of the Kurt Gödel Society. Volume 2. Wien: Springer-Verlag. 21--49 (1996; Zbl 0851.03004)
Jim, Trevor; Meyer, Albert R. Full abstraction and the context lemma. (English) Zbl 0856.03013 SIAM J. Comput. 25, No. 3, 663-696 (1996). Reviewer: G.E.Tseytlin (Kiev) MSC: 03B40 68N15 68W30 68Q42 68Q55 PDFBibTeX XMLCite \textit{T. Jim} and \textit{A. R. Meyer}, SIAM J. Comput. 25, No. 3, 663--696 (1996; Zbl 0856.03013) Full Text: DOI
Cavaliere, Fania The works of Hugh MacColl and the origins of nonclassical logic. (Italian. English summary) Zbl 0985.03003 Mod. Log. 6, No. 4, 373-402 (1996). MSC: 03-03 03B45 01A55 01A60 01A70 03B47 PDFBibTeX XMLCite \textit{F. Cavaliere}, Mod. Log. 6, No. 4, 373--402 (1996; Zbl 0985.03003)
Deakin, Michael A. B. Boole’s mathematical blindness. (English) Zbl 0877.01019 Math. Gaz. 80, No. 489, 511-518 (1996). Reviewer: V.Peckhaus (Erlangen) MSC: 01A55 03A05 34-03 PDFBibTeX XMLCite \textit{M. A. B. Deakin}, Math. Gaz. 80, No. 489, 511--518 (1996; Zbl 0877.01019) Full Text: DOI
Engeler, Erwin The combinatory programme. Erwin Engeler in collaboration with K. Aberer, B. Amrhein, O. Gloor, M. von Mohrenschildt, D. Otth, G. Schwärzler, and T. Weibel. (English) Zbl 0827.03004 Progress in Theoretical Computer Science. Basel: Birkhäuser. 142 p. (1995). Reviewer: C.Masalagiu (Iaşi) MSC: 03B40 08A70 68Q05 03-02 68-02 03G25 68W30 03C05 00B15 68N15 PDFBibTeX XMLCite \textit{E. Engeler}, The combinatory programme. Erwin Engeler in collaboration with K. Aberer, B. Amrhein, O. Gloor, M. von Mohrenschildt, D. Otth, G. Schwärzler, and T. Weibel. Basel: Birkhäuser (1995; Zbl 0827.03004)
Budimac, Zoran; Maćoš, Dragan; Ivanović, Mirjana Another bracket abstraction algorithm. (English) Zbl 0837.68013 Jaćimović, M. (ed.), VIII conference on applied mathematics, Tivat, Yugoslavia, May 27-29, 1993. Podgorica: University of Montenegro, Dept. of Mathematics, 23-28 (1994). MSC: 68N20 03B40 68W30 68N15 PDFBibTeX XMLCite \textit{Z. Budimac} et al., in: VIII conference on applied mathematics, Tivat, Yugoslavia, May 27-29, 1993. Podgorica: University of Montenegro, Dept. of Mathematics. 23--28 (1994; Zbl 0837.68013)
Crossley, John N.; Shepherdson, John C. Extracting programs from proofs by an extension of the Curry-Howard process. (English) Zbl 0821.03017 Crossley, John N. (ed.) et al., Logical methods. In honor of Anil Nerode’s 60th birthday. Basel: Birkhäuser. Prog. Comput. Sci. Appl. Log. 12, 222-288 (1993). Reviewer: N.Curteanu (Iaşi) MSC: 03B70 68W30 03B35 68Q60 12Y05 PDFBibTeX XMLCite \textit{J. N. Crossley} and \textit{J. C. Shepherdson}, Prog. Comput. Sci. Appl. Log. 12, 222--288 (1993; Zbl 0821.03017)
Breazu-Tannen, Val; Meyer, Albert R. Conservativity of equational theories in typed lambda calculi. (English) Zbl 0784.68057 Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 19, No. 1-2, 1-49 (1993). Reviewer: R.David (Chambéry) MSC: 68Q65 03B40 68N15 18C10 68W30 PDFBibTeX XMLCite \textit{V. Breazu-Tannen} and \textit{A. R. Meyer}, Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 19, No. 1--2, 1--49 (1993; Zbl 0784.68057)
Dougherty, Daniel J. Higher-order unification via combinators. (English) Zbl 0772.68061 Theor. Comput. Sci. 114, No. 2, 273-298 (1993). MSC: 68W30 03B45 PDFBibTeX XMLCite \textit{D. J. Dougherty}, Theor. Comput. Sci. 114, No. 2, 273--298 (1993; Zbl 0772.68061) Full Text: DOI
Aberer, Karl Combinatory differential fields and constructive analysis. (English) Zbl 0781.03050 Zürich: ETH Zürich, xiv, 155 p. (1991). MSC: 03F60 68W30 03B40 12Y05 PDFBibTeX XMLCite \textit{K. Aberer}, Combinatory differential fields and constructive analysis. Zürich: ETH Zürich (1991; Zbl 0781.03050)
Curien, Pierre-Louis; Ríos, Alejandro Un résultat de complétude pour les substitutions explicites. (A completeness result for explicit substitutions). (French) Zbl 0717.68053 C. R. Acad. Sci., Paris, Sér. I 312, No. 6, 471-476 (1991). MSC: 68W30 03B40 PDFBibTeX XMLCite \textit{P.-L. Curien} and \textit{A. Ríos}, C. R. Acad. Sci., Paris, Sér. I 312, No. 6, 471--476 (1991; Zbl 0717.68053)
Leivant, Daniel Subrecursion and lambda representation over free algebras. Preliminary summary. (English) Zbl 0772.03020 Feasible mathematics, Proc. Math. Sci. Inst. Workshop, Ithaca/NY (USA) 1989, Prog. Comput. Sci. Appl. Log. 9, 281-291 (1990). MSC: 03D20 03B40 68Q05 03D80 68W30 PDFBibTeX XMLCite \textit{D. Leivant}, Prog. Comput. Sci. Appl. Log. 9, 281--291 (1990; Zbl 0772.03020)
Luo, Zhaohui ECC, an extended calculus of constructions. (English) Zbl 0723.03034 Logic in computer science, Proc. 4th Annual Symp., Pacific Grove/CA (USA) 1989, 386-395 (1989). Reviewer: C.Berline (Paris) MSC: 03F35 68W30 03B40 PDFBibTeX XML
Gallier, Jean H.; Snyder, Wayne Complete sets of transformations for general E-unification. (English) Zbl 0686.68024 Theor. Comput. Sci. 67, No. 2-3, 203-260 (1989). MSC: 68W30 68T15 68Q65 03B40 08A50 03B35 PDFBibTeX XMLCite \textit{J. H. Gallier} and \textit{W. Snyder}, Theor. Comput. Sci. 67, No. 2--3, 203--260 (1989; Zbl 0686.68024) Full Text: DOI Link
Breazu-Tannen, Val; Gallier, Jean Polymorphic rewriting conserves algebraic strong normalization and confluence. (English) Zbl 0686.68022 Automata, languages and programming, Proc. 16th Int. Colloq., Stresa/Italy 1989, Lect. Notes Comput. Sci. 372, 137-150 (1989). MSC: 68W30 68Q65 68P05 03D03 03B40 08A99 PDFBibTeX XML
Boom, H. J. Lazy variable-renumbering makes substitution cheap. (English) Zbl 0662.68015 Inf. Process. Lett. 29, No. 5, 229-232 (1988). MSC: 68P05 68W30 03B40 PDFBibTeX XMLCite \textit{H. J. Boom}, Inf. Process. Lett. 29, No. 5, 229--232 (1988; Zbl 0662.68015) Full Text: DOI
Talcott, Carolyn Rum - An abstraction theory of function and control abstractions. (English) Zbl 0651.68040 Foundations of logic and functional programming, Proc. Workshop, Trento/Italy 1986, Lect. Notes Comput. Sci. 306, 3-44 (1988). Reviewer: T.Balanescu MSC: 68W30 68Q65 68Q60 03B40 PDFBibTeX XML
Staples, John Delaying unification algorithms for lambda calculi. (English) Zbl 0647.68092 Theor. Comput. Sci. 56, No. 3, 277-288 (1988). MSC: 68T15 03B40 68W30 PDFBibTeX XMLCite \textit{J. Staples}, Theor. Comput. Sci. 56, No. 3, 277--288 (1988; Zbl 0647.68092) Full Text: DOI
Zhang, Hantao; Kapur, Deepak First-order theorem proving using conditional rewrite rules. (English) Zbl 0645.68096 Automated deduction, Proc. 9th Int. Conf., Argonne/Ill. 1988, Lect. Notes Comput. Sci. 310, 1-20 (1988). MSC: 68T15 03B35 68W30 03B10 06A06 PDFBibTeX XML
Flaherty, Terry Symbolic manipulation in an extended \(\lambda\)-calculus. (English) Zbl 0634.68025 SIGSAM Bull. 22, No. 1, 21-24 (1988). MSC: 68W30 03B40 PDFBibTeX XMLCite \textit{T. Flaherty}, SIGSAM Bull. 22, No. 1, 21--24 (1988; Zbl 0634.68025) Full Text: DOI
Gibert, Jacek Functional programming with combinators. (English) Zbl 0637.68041 J. Symb. Comput. 4, 269-293 (1987). MSC: 68W30 68N25 03B40 68Q65 PDFBibTeX XMLCite \textit{J. Gibert}, J. Symb. Comput. 4, 269--293 (1987; Zbl 0637.68041) Full Text: DOI
Jones, Neil D. Flow analysis of lambda expressions (Preliminary version). (English) Zbl 0481.68027 Automata, languages and programming, 8th Colloq., Acre (Akko)/Isr. 1981, Lect. Notes Comput. Sci. 115, 114-128 (1981). MSC: 68Q60 68W30 03B40 PDFBibTeX XML
Astesiano, Egidio; Costa, Gerardo Delayed evaluation trees and their application to semantics. (English) Zbl 0462.68004 Les arbres en algebre et en programmation, 5ieme Colloq., Lille 1980, 110-118 (1980). MSC: 68Q65 68Q60 03B40 68N01 PDFBibTeX XML
van der Poel, W. L.; Schaap, C. E.; van der Mey, G. New arithmetical operators in the theory of combinators. III. (English) Zbl 0442.03017 Indag. Math. 42, 303-325 (1980). MSC: 03B40 68W30 03-04 PDFBibTeX XMLCite \textit{W. L. van der Poel} et al., Indag. Math. 42, 303--325 (1980; Zbl 0442.03017)
van der Poel, W. L.; Schaap, C. E.; van der Mey, G. New arithmetical operators in the theory of combinators. II. (English) Zbl 0442.03016 Indag. Math. 42, 287-302 (1980). MSC: 03B40 68W30 PDFBibTeX XMLCite \textit{W. L. van der Poel} et al., Indag. Math. 42, 287--302 (1980; Zbl 0442.03016)
van der Poel, W. L.; Schaap, C. E.; van der Mey, G. New arithmetical operators in the theory of combinators. I. (English) Zbl 0442.03015 Indag. Math. 42, 271-286 (1980). MSC: 03B40 68W30 PDFBibTeX XMLCite \textit{W. L. van der Poel} et al., Indag. Math. 42, 271--286 (1980; Zbl 0442.03015)
Berry, G. Sequentialite de l’evaluation formelle des \(\lambda\)-expressions. (French) Zbl 0416.03017 Program transformations, Proc. 3rd int. Symp. Program., Paris 1978, 67-80 (1978). MSC: 03B40 PDFBibTeX XML
Robinet, B. Un modèle fonctionnel des structures de contrôle. (French) Zbl 0389.68015 RAIRO, Inf. Théor. 11, 213-236 (1977). MSC: 68W30 68Q65 03B40 PDFBibTeX XMLCite \textit{B. Robinet}, RAIRO, Inf. Théor. 11, 213--236 (1977; Zbl 0389.68015) Full Text: EuDML
Bergman, Marc; Kanoui, Henry Axiomatisation des manipulations symboliques en calcul des prédicats. (French) Zbl 0384.68043 Bull. Soc. Math. Fr., Suppl., Mém. 49-50 (Conf. Limoges 1975), 15-30 (1977). MSC: 68W30 68N99 03B10 03B40 03-04 26-04 PDFBibTeX XMLCite \textit{M. Bergman} and \textit{H. Kanoui}, Bull. Soc. Math. Fr., Suppl., Mém. 49--50, 15--30 (1977; Zbl 0384.68043) Full Text: Numdam EuDML
Hennessy, M.; Ashcroft, E. A. The semantics of nondeterminism. (English) Zbl 0379.02015 Automata, languages and programming, 3rd int. Colloq. Edinburgh 1976, 478-493 (1976). MSC: 03D99 68W30 68W99 03B40 PDFBibTeX XML
Huet, G. P. A unification algorithm for typed \(\overline\lambda\)-calculus. (English) Zbl 0337.68027 Theor. Comput. Sci. 1, 27-57 (1975). MSC: 68W30 68W99 68Q25 03B40 PDFBibTeX XMLCite \textit{G. P. Huet}, Theor. Comput. Sci. 1, 27--57 (1975; Zbl 0337.68027) Full Text: DOI
Raulefs, Peter The D-calculus: A system to describe the semantics of programs involving complex data types. (English) Zbl 0327.68027 GI, 4. Jahrestag., Berlin 1974, Lect. Notes Computer Sci. 26, 140-152 (1975). MSC: 68N01 68Q45 68Q25 03B40 68W30 PDFBibTeX XML
Böhm, Corrado; Dezani-Ciancaglini, Mariangiola Combinatorial problems, combinator equations and normal forms. (English) Zbl 0309.68037 Automata, Languages, Progr.; 2nd Colloqu., Univ. Saarbrücken, Lecture Notes Computer Sci. 14, 185-199 (1974). MSC: 68W99 68Q25 68W30 03B40 PDFBibTeX XML