Hasegawa, Ryu Complete call-by-value calculi of control operators. II: Strong termination. (English) Zbl 1509.03058 Log. Methods Comput. Sci. 17, No. 1, Paper No. 18, 20 p. (2021). MSC: 03B40 PDFBibTeX XMLCite \textit{R. Hasegawa}, Log. Methods Comput. Sci. 17, No. 1, Paper No. 18, 20 p. (2021; Zbl 1509.03058) Full Text: arXiv Link
Battyányi, Péter; Nour, Karim Normalization proofs for the un-typed \(\mu\mu^\prime\)-calculus. (English) Zbl 1484.03021 AIMS Math. 5, No. 4, 3702-3713 (2020). MSC: 03B40 03F05 PDFBibTeX XMLCite \textit{P. Battyányi} and \textit{K. Nour}, AIMS Math. 5, No. 4, 3702--3713 (2020; Zbl 1484.03021) Full Text: DOI
Kesner, Delia; Vial, Pierre Consuming and persistent types for classical logic. (English) Zbl 1498.03042 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 619-632 (2020). MSC: 03B40 PDFBibTeX XMLCite \textit{D. Kesner} and \textit{P. Vial}, in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 619--632 (2020; Zbl 1498.03042) Full Text: DOI
Kesner, Delia; Vial, Pierre Non-idempotent types for classical calculi in natural deduction style. (English) Zbl 1528.03127 Log. Methods Comput. Sci. 16, No. 1, Paper No. 3, 46 p. (2020). MSC: 03B40 PDFBibTeX XMLCite \textit{D. Kesner} and \textit{P. Vial}, Log. Methods Comput. Sci. 16, No. 1, Paper No. 3, 46 p. (2020; Zbl 1528.03127) Full Text: arXiv
Battyányi, Péter; Nour, Karim An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus. (English) Zbl 1453.03007 Log. Methods Comput. Sci. 14, No. 2, Paper No. 17, 35 p. (2018). MSC: 03B40 PDFBibTeX XMLCite \textit{P. Battyányi} and \textit{K. Nour}, Log. Methods Comput. Sci. 14, No. 2, Paper No. 17, 35 p. (2018; Zbl 1453.03007) Full Text: DOI arXiv
van Bakel, Steffen Characterisation of normalisation properties for \(\lambda\mu\) using strict negated intersection types. (English) Zbl 1407.03015 ACM Trans. Comput. Log. 19, No. 1, Article No. 3, 47 p. (2018). MSC: 03B40 PDFBibTeX XMLCite \textit{S. van Bakel}, ACM Trans. Comput. Log. 19, No. 1, Article No. 3, 47 p. (2018; Zbl 1407.03015) Full Text: DOI Link
van Bakel, Steffen; Barbanera, Franco; de’Liguoro, Ugo Intersection types for the \(\lambda\mu\)-calculus. (English) Zbl 1459.03018 Log. Methods Comput. Sci. 14, No. 1, Paper No. 2, 61 p. (2018). MSC: 03B40 PDFBibTeX XMLCite \textit{S. van Bakel} et al., Log. Methods Comput. Sci. 14, No. 1, Paper No. 2, 61 p. (2018; Zbl 1459.03018) Full Text: DOI arXiv
Kesner, Delia; Vial, Pierre Types as resources for classical natural deduction. (English) Zbl 1434.03053 Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 24, 17 p. (2017). MSC: 03B40 PDFBibTeX XMLCite \textit{D. Kesner} and \textit{P. Vial}, LIPIcs -- Leibniz Int. Proc. Inform. 84, Article 24, 17 p. (2017; Zbl 1434.03053) Full Text: DOI
Battyanyi, Peter; Nour, Karim Strong normalization of \(\lambda^{\mathrm{Sym}}_{\mathrm{Prop}}\)- and \(\overline{\lambda}\mu\overline{\mu}^\ast\)-calculi. (English) Zbl 1459.03014 Log. Methods Comput. Sci. 13, No. 3, Paper No. 34, 22 p. (2017). MSC: 03B40 PDFBibTeX XMLCite \textit{P. Battyanyi} and \textit{K. Nour}, Log. Methods Comput. Sci. 13, No. 3, Paper No. 34, 22 p. (2017; Zbl 1459.03014) Full Text: DOI arXiv
Liang, Chuck Unified semantics and proof system for classical, intuitionistic and affine logics. (English) Zbl 1395.03038 Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5–8, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4391-6). 156-165 (2016). MSC: 03F52 03B10 03B20 PDFBibTeX XMLCite \textit{C. Liang}, in: Proceedings of the 2016 31st annual ACM/IEEE symposium on logic in computer science, LICS 2016, New York City, NY, USA, July 5--8, 2016. New York, NY: Association for Computing Machinery (ACM). 156--165 (2016; Zbl 1395.03038) Full Text: DOI
Nakazawa, Koji; Fujita, Ken-etsu Compositional Z: confluence proofs for permutative conversion. (English) Zbl 1368.03020 Stud. Log. 104, No. 6, 1205-1224 (2016). Reviewer: Martin W. Bunder (Wollongong) MSC: 03B40 PDFBibTeX XMLCite \textit{K. Nakazawa} and \textit{K.-e. Fujita}, Stud. Log. 104, No. 6, 1205--1224 (2016; Zbl 1368.03020) Full Text: DOI
Pédrot, Pierre-Marie; Saurin, Alexis Classical by-need. (English) Zbl 1335.68034 Thiemann, Peter (ed.), Programming languages and systems. 25th European symposium on programming, ESOP 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2–8, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49497-4/pbk; 978-3-662-49498-1/ebook). Lecture Notes in Computer Science 9632, 616-643 (2016). MSC: 68N18 03B40 03B70 03F52 PDFBibTeX XMLCite \textit{P.-M. Pédrot} and \textit{A. Saurin}, Lect. Notes Comput. Sci. 9632, 616--643 (2016; Zbl 1335.68034) Full Text: DOI
Blot, Valentin Typed realizability for first-order classical analysis. (English) Zbl 1351.03006 Log. Methods Comput. Sci. 11, No. 4, Paper No. 22, 43 p. (2015). MSC: 03B40 03F55 03F30 03E25 03B70 PDFBibTeX XMLCite \textit{V. Blot}, Log. Methods Comput. Sci. 11, No. 4, Paper No. 22, 43 p. (2015; Zbl 1351.03006) Full Text: DOI arXiv
Nakazawa, Koji; Naya, Hiroto Strong reduction of combinatory calculus with streams. (English) Zbl 1326.03023 Stud. Log. 103, No. 2, 375-387 (2015). MSC: 03B40 PDFBibTeX XMLCite \textit{K. Nakazawa} and \textit{H. Naya}, Stud. Log. 103, No. 2, 375--387 (2015; Zbl 1326.03023) Full Text: DOI
Bonelli, Eduardo; Steren, Gabriela Hypothetical logic of proofs. (English) Zbl 1335.03020 Log. Univers. 8, No. 1, 103-140 (2014). MSC: 03B45 03B40 PDFBibTeX XMLCite \textit{E. Bonelli} and \textit{G. Steren}, Log. Univers. 8, No. 1, 103--140 (2014; Zbl 1335.03020) Full Text: DOI
Komori, Yuichi \(\lambda \rho\)-calculus. II. (English) Zbl 1280.03016 Tsukuba J. Math. 37, No. 2, 307-320 (2013). MSC: 03B40 03B05 PDFBibTeX XMLCite \textit{Y. Komori}, Tsukuba J. Math. 37, No. 2, 307--320 (2013; Zbl 1280.03016) Full Text: DOI Euclid
Nour, Karim; Saber, Khelifa Some properties of the \(\lambda\mu^{\wedge\vee}\)-calculus. (English) Zbl 1398.03065 J. Appl. Non-Class. Log. 22, No. 3, 231-247 (2012). MSC: 03B40 PDFBibTeX XMLCite \textit{K. Nour} and \textit{K. Saber}, J. Appl. Non-Class. Log. 22, No. 3, 231--247 (2012; Zbl 1398.03065) Full Text: DOI
Ariola, Zena M.; Downen, Paul; Herbelin, Hugo; Nakata, Keiko; Saurin, Alexis Classical call-by-need sequent calculi: the unity of semantic artifacts. (English) Zbl 1354.68043 Schrijvers, Tom (ed.) et al., Functional and logic programming. 11th international symposium, FLOPS 2012, Kobe, Japan, May 23–25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29821-9/pbk). Lecture Notes in Computer Science 7294, 32-46 (2012). MSC: 68N18 03B40 03B70 PDFBibTeX XMLCite \textit{Z. M. Ariola} et al., Lect. Notes Comput. Sci. 7294, 32--46 (2012; Zbl 1354.68043) Full Text: DOI HAL
Saurin, Alexis Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus. (English) Zbl 1244.68027 Theor. Comput. Sci. 435, 106-138 (2012). MSC: 68N18 03B40 PDFBibTeX XMLCite \textit{A. Saurin}, Theor. Comput. Sci. 435, 106--138 (2012; Zbl 1244.68027) Full Text: DOI
Houtmann, Clément Superdeduction in \(\bar{\lambda}\mu\tilde{\mu}\). (English) Zbl 1456.03086 van Bakel, Steffen (ed.) et al., Third international workshop on classical logic and computation, Brno, Czech Republic, August 21–22, 2010. Proceedings. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 47, 34-43 (2011). MSC: 03F05 03B40 03F07 68Q42 PDFBibTeX XMLCite \textit{C. Houtmann}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 47, 34--43 (2011; Zbl 1456.03086) Full Text: arXiv Link
Ariola, Zena M.; Herbelin, Hugo; Saurin, Alexis Classical call-by-need and duality. (English) Zbl 1331.68041 Ong, Luke (ed.), Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1–3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21690-9/pbk; 978-3-642-21691-6/ebook). Lecture Notes in Computer Science 6690, 27-44 (2011). MSC: 68N18 PDFBibTeX XMLCite \textit{Z. M. Ariola} et al., Lect. Notes Comput. Sci. 6690, 27--44 (2011; Zbl 1331.68041) Full Text: DOI
Saurin, Alexis Typing streams in the \({\Lambda}{\mu}\)-calculus. (English) Zbl 1351.68065 ACM Trans. Comput. Log. 11, No. 4, Article No. 28, 34 p. (2010). MSC: 68N18 PDFBibTeX XMLCite \textit{A. Saurin}, ACM Trans. Comput. Log. 11, No. 4, Article No. 28, 34 p. (2010; Zbl 1351.68065) Full Text: DOI
Ilik, Danko; Lee, Gyesik; Herbelin, Hugo Kripke models for classical logic. (English) Zbl 1225.03009 Ann. Pure Appl. Logic 161, No. 11, 1367-1378 (2010). MSC: 03B10 03B40 PDFBibTeX XMLCite \textit{D. Ilik} et al., Ann. Pure Appl. Logic 161, No. 11, 1367--1378 (2010; Zbl 1225.03009) Full Text: DOI arXiv
David, René; Nour, Karim Strong normalization results by translation. (English) Zbl 1223.03037 Ann. Pure Appl. Logic 161, No. 9, 1171-1179 (2010). MSC: 03F05 03B40 PDFBibTeX XMLCite \textit{R. David} and \textit{K. Nour}, Ann. Pure Appl. Logic 161, No. 9, 1171--1179 (2010; Zbl 1223.03037) Full Text: DOI
Laurent, Olivier Game semantics for first-order logic. (English) Zbl 1211.03016 Log. Methods Comput. Sci. 6, No. 4, Paper No. 3, 50 p. (2010). MSC: 03B10 03B40 PDFBibTeX XMLCite \textit{O. Laurent}, Log. Methods Comput. Sci. 6, No. 4, Paper No. 3, 50 p. (2010; Zbl 1211.03016) Full Text: DOI arXiv
Saurin, Alexis A hierarchy for delimited continuations in call-by-name. (English) Zbl 1284.03139 Ong, Luke (ed.), Foundations of software science and computational structures. 13th international conference, FOSSACS 2010, held as part of the joint European conferences on theory and practice of software, ETAPS 2010, Paphos, Cyprus, March 20–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12031-2/pbk). Lecture Notes in Computer Science 6014, 374-388 (2010). MSC: 03B40 68N18 PDFBibTeX XMLCite \textit{A. Saurin}, Lect. Notes Comput. Sci. 6014, 374--388 (2010; Zbl 1284.03139) Full Text: DOI
Nour, Karim; Saber, Khelifa A completeness result for the simply typed \(\lambda \mu \)-calculus. (English) Zbl 1184.03007 Ann. Pure Appl. Logic 161, No. 1, 109-118 (2009). Reviewer: Martin W. Bunder (Wollongong) MSC: 03B40 PDFBibTeX XMLCite \textit{K. Nour} and \textit{K. Saber}, Ann. Pure Appl. Logic 161, No. 1, 109--118 (2009; Zbl 1184.03007) Full Text: DOI arXiv
Komendantsky, Vladimir Denotational semantics of call-by-name normalization in lambda-mu calculus. (English) Zbl 1336.68031 Seda, Anthony (ed.) et al., Proceedings of the Irish conference on the mathematical foundations of computer science and information technology (MFCSIT 2006), National University of Ireland, Cork, Ireland, August 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 225, 161-179 (2009). MSC: 68N18 18C50 68Q55 PDFBibTeX XMLCite \textit{V. Komendantsky}, Electron. Notes Theor. Comput. Sci. 225, 161--179 (2008; Zbl 1336.68031) Full Text: DOI
Saurin, Alexis On the relations between the syntactic theories of \(\lambda \mu \)-calculi. (English) Zbl 1156.03317 Kaminski, Michael (ed.) et al., Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). Lecture Notes in Computer Science 5213, 154-168 (2008). MSC: 03B40 03B70 68N18 PDFBibTeX XMLCite \textit{A. Saurin}, Lect. Notes Comput. Sci. 5213, 154--168 (2008; Zbl 1156.03317) Full Text: DOI
Nakazawa, Koji; Tatsuta, Makoto Strong normalization of classical natural deduction with disjunctions. (English) Zbl 1141.03027 Ann. Pure Appl. Logic 153, No. 1-3, 21-37 (2008). Reviewer: M. Yasuhara (Princeton) MSC: 03F05 03B05 03B40 PDFBibTeX XMLCite \textit{K. Nakazawa} and \textit{M. Tatsuta}, Ann. Pure Appl. Logic 153, No. 1--3, 21--37 (2008; Zbl 1141.03027) Full Text: DOI
de Lataillade, Joachim Second-order type isomorphisms through game semantics. (English) Zbl 1136.03023 Ann. Pure Appl. Logic 151, No. 2-3, 115-150 (2008). MSC: 03B70 03B40 18C50 68Q55 91A80 PDFBibTeX XMLCite \textit{J. de Lataillade}, Ann. Pure Appl. Logic 151, No. 2--3, 115--150 (2008; Zbl 1136.03023) Full Text: DOI
Vaux, Lionel The differential \(\lambda \mu\)-calculus. (English) Zbl 1121.03026 Theor. Comput. Sci. 379, No. 1-2, 166-209 (2007). MSC: 03B40 03F52 PDFBibTeX XMLCite \textit{L. Vaux}, Theor. Comput. Sci. 379, No. 1--2, 166--209 (2007; Zbl 1121.03026) Full Text: DOI
de Paiva, Valeria; Ritter, Eike A Parigot-style linear \(\lambda\)-calculus for full intuitionistic linear logic. (English) Zbl 1114.03012 Theory Appl. Categ. 17, 30-48 (2006). Reviewer: Vladimir Komendantsky (Sophia Antipolis) MSC: 03B40 03B47 03F52 PDFBibTeX XMLCite \textit{V. de Paiva} and \textit{E. Ritter}, Theory Appl. Categ. 17, 30--48 (2006; Zbl 1114.03012) Full Text: EuDML EMIS
Matthes, Ralph Stabilization – an alternative to double-negation translation for classical natural deduction. (English) Zbl 1102.03008 Stoltenberg-Hansen, Viggo (ed.) et al., Logic colloquium ’03. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Helsinki, Finland, August 14–20, 2003. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 1-56881-293-0/hbk; 1-56881-294-9/pbk). Lecture Notes in Logic 24, 167-199 (2006). MSC: 03B40 03F05 PDFBibTeX XMLCite \textit{R. Matthes}, Lect. Notes Log. 24, 167--199 (2006; Zbl 1102.03008)
Kakutani, Yoshihiko; Hasegawa, Masahito Parameterizations and fixed-point operators on control categories. (English) Zbl 1089.03022 Fundam. Inform. 65, No. 1-2, 153-172 (2005). MSC: 03B70 03B40 PDFBibTeX XMLCite \textit{Y. Kakutani} and \textit{M. Hasegawa}, Fundam. Inform. 65, No. 1--2, 153--172 (2005; Zbl 1089.03022)
Matthes, Ralph Non-strictly positive fixed points for classical natural deduction. (English) Zbl 1066.03057 Ann. Pure Appl. Logic 133, No. 1-3, 205-230 (2005). Reviewer: M. Yasuhara (Princeton) MSC: 03F05 03B40 68N18 PDFBibTeX XMLCite \textit{R. Matthes}, Ann. Pure Appl. Logic 133, No. 1--3, 205--230 (2005; Zbl 1066.03057) Full Text: DOI
Laurent, Olivier Polarized games. (English) Zbl 1055.03020 Ann. Pure Appl. Logic 130, No. 1-3, 79-123 (2004). MSC: 03B70 03F52 03B40 PDFBibTeX XMLCite \textit{O. Laurent}, Ann. Pure Appl. Logic 130, No. 1--3, 79--123 (2004; Zbl 1055.03020) Full Text: DOI
Akama, Yohji Limiting partial combinatory algebras. (English) Zbl 1088.03012 Theor. Comput. Sci. 311, No. 1-3, 199-220 (2004). MSC: 03B40 03G25 PDFBibTeX XMLCite \textit{Y. Akama}, Theor. Comput. Sci. 311, No. 1--3, 199--220 (2004; Zbl 1088.03012) Full Text: DOI
Wadler, Philip Call-by-value is dual to call-by-name. (English) Zbl 1315.68060 Proceedings of the 8th ACM SIGPLAN international conference on functional programming, ICFP ’03, Uppsala, Sweden, August 25–29, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-756-7). ACM SIGPLAN Notices 38, No. 9, 189-201 (2003). MSC: 68N18 03B70 PDFBibTeX XMLCite \textit{P. Wadler}, in: Proceedings of the 8th ACM SIGPLAN international conference on functional programming, ICFP '03, Uppsala, Sweden, August 25--29, 2003. New York, NY: Association for Computing Machinery (ACM). 189--201 (2003; Zbl 1315.68060) Full Text: DOI
David, René; Nour, Karim A short proof of the strong normalization of classical natural deduction with disjunction. (English) Zbl 1066.03056 J. Symb. Log. 68, No. 4, 1277-1288 (2003). Reviewer: M. Yasuhara (Princeton) MSC: 03F05 03B05 03B40 68N18 PDFBibTeX XMLCite \textit{R. David} and \textit{K. Nour}, J. Symb. Log. 68, No. 4, 1277--1288 (2003; Zbl 1066.03056) Full Text: DOI arXiv Euclid
Fujita, Ken-etsu An injective CPS-translation for the extensional \(\lambda\)-calculus. (English) Zbl 1060.68020 Mem. Fac. Sci. Eng., Shimane Univ., Ser. B, Math. Sci. 36, 39-48 (2003). MSC: 68N18 68Q05 68Q55 03B40 PDFBibTeX XMLCite \textit{K.-e. Fujita}, Mem. Fac. Sci. Eng., Shimane Univ., Ser. B, Math. Sci. 36, 39--48 (2003; Zbl 1060.68020)
Nour, Karim Non deterministic classical logic: The \(\lambda\mu^{++}\)-calculus. (English) Zbl 0997.03015 Math. Log. Q. 48, No. 3, 357-366 (2002). MSC: 03B40 68N18 03B70 PDFBibTeX XMLCite \textit{K. Nour}, Math. Log. Q. 48, No. 3, 357--366 (2002; Zbl 0997.03015) Full Text: DOI arXiv
David, René; Py, Walter \(\lambda\mu\)-calculus and Böhm’s theorem. (English) Zbl 0981.03019 J. Symb. Log. 66, No. 1, 407-413 (2001). Reviewer: M.W.Bunder (Wollongong) MSC: 03B40 PDFBibTeX XMLCite \textit{R. David} and \textit{W. Py}, J. Symb. Log. 66, No. 1, 407--413 (2001; Zbl 0981.03019) Full Text: DOI
Pym, David; Ritter, Eike On the semantics of classical disjunction. (English) Zbl 0981.03018 J. Pure Appl. Algebra 159, No. 2-3, 315-338 (2001). Reviewer: Andrea Cantini (Firenze) MSC: 03B40 03F03 03G30 03B05 68Q55 PDFBibTeX XMLCite \textit{D. Pym} and \textit{E. Ritter}, J. Pure Appl. Algebra 159, No. 2--3, 315--338 (2001; Zbl 0981.03018) Full Text: DOI
Fujita, Ken-Etsu Domain-free \(\lambda\mu\)-calculus. (English) Zbl 0974.68032 Theor. Inform. Appl. 34, No. 6, 433-466 (2000). MSC: 68N18 68Q05 03B40 PDFBibTeX XMLCite \textit{K.-E. Fujita}, Theor. Inform. Appl. 34, No. 6, 433--466 (2000; Zbl 0974.68032) Full Text: DOI EuDML
Ivanov, Lyubomir Boldface recursion on Platek spaces. (English) Zbl 0969.03053 Fundam. Inform. 44, No. 1-2, 183-208 (2000). MSC: 03D75 03B40 PDFBibTeX XMLCite \textit{L. Ivanov}, Fundam. Inform. 44, No. 1--2, 183--208 (2000; Zbl 0969.03053)
Ritter, Eike; Pym, David; Wallen, Lincoln On the intuitionistic force of classical search. (English) Zbl 0952.03007 Theor. Comput. Sci. 232, No. 1-2, 299-333 (2000). MSC: 03B35 03B20 03B40 03F03 03B70 PDFBibTeX XMLCite \textit{E. Ritter} et al., Theor. Comput. Sci. 232, No. 1--2, 299--333 (2000; Zbl 0952.03007) Full Text: DOI
Fujita, Ken-etsu Explicitly typed \(\lambda\mu\)-calculus for polymorphism and call-by-value. (English) Zbl 0933.03009 Girard, Jean-Yves (ed.), Typed lambda calculi and applications. 4th international conference, TLCA ’99. L’Aquila, Italy, April 7–9, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1581, 162-176 (1999). MSC: 03B40 68N18 03B70 PDFBibTeX XMLCite \textit{K.-e. Fujita}, Lect. Notes Comput. Sci. 1581, 162--176 (1999; Zbl 0933.03009)
Fujita, Ken-Etsu On proof terms and embeddings of classical substructural logics. (English) Zbl 0962.03015 Stud. Log. 61, No. 2, 199-221 (1998). MSC: 03B47 03B40 PDFBibTeX XMLCite \textit{K.-E. Fujita}, Stud. Log. 61, No. 2, 199--221 (1998; Zbl 0962.03015) Full Text: DOI
de Groote, Philippe An environment machine for the \(\lambda\mu\)-calculus. (English) Zbl 0918.03017 Math. Struct. Comput. Sci. 8, No. 6, 637-669 (1998). MSC: 03B70 68N01 03B40 68Q60 PDFBibTeX XMLCite \textit{P. de Groote}, Math. Struct. Comput. Sci. 8, No. 6, 637--669 (1998; Zbl 0918.03017) Full Text: DOI
Bierman, G. M. A computational interpretation of the \(\lambda\mu\)-calculus. (English) Zbl 0912.03009 Brim, Luboš (ed.) et al., Mathematical foundations of computer science 1998. 23rd international symposium, MFCS ’98. Brno, Czech Republic, August 24–28, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1450, 336-345 (1998). MSC: 03B40 68Q55 PDFBibTeX XMLCite \textit{G. M. Bierman}, Lect. Notes Comput. Sci. 1450, 336--345 (1998; Zbl 0912.03009)
Joly, Thierry An embedding of \(2^{\text{nd}}\) order classical logic into \(\text{FA}_ 2\). (Un prolongement de la logique classique du \(2^{\text{nd}}\) ordre dans \(\text{AF}_ 2\).) (French) Zbl 0878.03039 C. R. Acad. Sci., Paris, Sér. I, Math. 325, No. 1, 1-4 (1997). MSC: 03F05 03B40 03B15 03F35 PDFBibTeX XMLCite \textit{T. Joly}, C. R. Acad. Sci., Paris, Sér. I, Math. 325, No. 1, 1--4 (1997; Zbl 0878.03039) Full Text: DOI
Nour, Karim The value of a classical integer in \(\lambda \mu\)-calculus. (La valeur d’un entier classique en \(\lambda \mu\)-calcul.) (French. English summary) Zbl 0878.03011 Arch. Math. Logic 36, No. 6, 461-473 (1997). Reviewer: K.Nour (Le Bourget-du-Lac) MSC: 03B40 68Q60 PDFBibTeX XMLCite \textit{K. Nour}, Arch. Math. Logic 36, No. 6, 461--473 (1997; Zbl 0878.03011) Full Text: DOI
Gavilanes-Franco, Antonio A first-order logic for partial recursive functions. (English) Zbl 0732.03026 Mathematical foundations of computer science, Proc. 15th Symp., MFCS ’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 277-284 (1990). MSC: 03B70 03D20 03F05 68Q55 PDFBibTeX XML