default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Richard Statman
@article{DBLP:journals/corr/abs-2309-03602,
author = {Richard Statman and
Gilles Dowek},
title = {On Statman's Finite Completeness Theorem},
journal = {CoRR},
volume = {abs/2309.03602},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.03602},
doi = {10.48550/ARXIV.2309.03602},
eprinttype = {arXiv},
eprint = {2309.03602},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-03602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/PolonskyS22,
author = {Andrew Polonsky and
Richard Statman},
title = {On sets of terms having a given intersection type},
journal = {Log. Methods Comput. Sci.},
volume = {18},
number = {3},
year = {2022},
url = {https://doi.org/10.46298/lmcs-18(3:35)2022},
doi = {10.46298/LMCS-18(3:35)2022},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/PolonskyS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/Statman22,
author = {Rick Statman},
editor = {Sergei N. Art{\"{e}}mov and
Anil Nerode},
title = {Finite Generation and Presentation Problems for Lambda Calculus and
Combinatory Logic},
booktitle = {Logical Foundations of Computer Science - International Symposium,
{LFCS} 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13137},
pages = {316--326},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-93100-1\_20},
doi = {10.1007/978-3-030-93100-1\_20},
timestamp = {Tue, 28 Dec 2021 15:24:58 +0100},
biburl = {https://dblp.org/rec/conf/lfcs/Statman22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fscd/Statman21,
author = {Rick Statman},
editor = {Naoki Kobayashi},
title = {Church's Semigroup Is Sq-Universal},
booktitle = {6th International Conference on Formal Structures for Computation
and Deduction, {FSCD} 2021, July 17-24, 2021, Buenos Aires, Argentina
(Virtual Conference)},
series = {LIPIcs},
volume = {195},
pages = {6:1--6:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSCD.2021.6},
doi = {10.4230/LIPICS.FSCD.2021.6},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fscd/Statman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/abs-2101-10494,
author = {Richard Statman},
editor = {David I. Spivak and
Jamie Vicary},
title = {Products in a Category with Only One Object},
booktitle = {Proceedings of the 3rd Annual International Applied Category Theory
Conference 2020, {ACT} 2020, Cambridge, USA, 6-10th July 2020},
series = {{EPTCS}},
volume = {333},
pages = {347--353},
year = {2020},
url = {https://doi.org/10.4204/EPTCS.333.24},
doi = {10.4204/EPTCS.333.24},
timestamp = {Fri, 05 Mar 2021 14:49:30 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-10494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Statman19,
author = {Rick Statman},
title = {Simple SubTypes of Intersection Types},
journal = {Fundam. Informaticae},
volume = {170},
number = {1-3},
pages = {307--324},
year = {2019},
url = {https://doi.org/10.3233/FI-2019-1864},
doi = {10.3233/FI-2019-1864},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Statman19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/Statman18,
author = {Rick Statman},
editor = {Sergei N. Art{\"{e}}mov and
Anil Nerode},
title = {The Completeness of {BCD} for an Operational Semantics},
booktitle = {Logical Foundations of Computer Science - International Symposium,
{LFCS} 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10703},
pages = {331--336},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-72056-2\_20},
doi = {10.1007/978-3-319-72056-2\_20},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/lfcs/Statman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-08169,
author = {Richard Statman},
title = {On sets of terms with a given intersection type},
journal = {CoRR},
volume = {abs/1809.08169},
year = {2018},
url = {http://arxiv.org/abs/1809.08169},
eprinttype = {arXiv},
eprint = {1809.08169},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-08169.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/IntrigilaS17,
author = {Benedetto Intrigila and
Richard Statman},
title = {Lambda theories allowing terms with a finite number of fixed points},
journal = {Math. Struct. Comput. Sci.},
volume = {27},
number = {3},
pages = {405--427},
year = {2017},
url = {https://doi.org/10.1017/S0960129515000419},
doi = {10.1017/S0960129515000419},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/IntrigilaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/Statman17,
author = {Rick Statman},
title = {Taming the wild ant-lion; a counterexample to a conjecture of B{\"{o}}hm},
journal = {Math. Struct. Comput. Sci.},
volume = {27},
number = {5},
pages = {734--737},
year = {2017},
url = {https://doi.org/10.1017/S0960129515000341},
doi = {10.1017/S0960129515000341},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/Statman17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/Statman16,
author = {Rick Statman},
editor = {Sergei N. Art{\"{e}}mov and
Anil Nerode},
title = {Levy Labels and Recursive Types},
booktitle = {Logical Foundations of Computer Science - International Symposium,
{LFCS} 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9537},
pages = {392--406},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-27683-0\_27},
doi = {10.1007/978-3-319-27683-0\_27},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/lfcs/Statman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/Statman16,
author = {Richard Statman},
editor = {Silvia Ghilezan and
Herman Geuvers and
Jelena Ivetic},
title = {The Completeness of {BCD} for an Operational Semantics},
booktitle = {22nd International Conference on Types for Proofs and Programs, {TYPES}
2016, May 23-26, 2016, Novi Sad, Serbia},
series = {LIPIcs},
volume = {97},
pages = {15:1--15:5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.TYPES.2016.15},
doi = {10.4230/LIPICS.TYPES.2016.15},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/types/Statman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/Statman16,
author = {Rick Statman},
editor = {Lars Birkedal},
title = {On the Representation of Semigroups and Other Congruences in the Lambda
Calculus},
booktitle = {The Thirty-second Conference on the Mathematical Foundations of Programming
Semantics, {MFPS} 2016, Carnegie Mellon University, Pittsburgh, PA,
USA, May 23-26, 2016},
series = {Electronic Notes in Theoretical Computer Science},
volume = {325},
pages = {299--304},
publisher = {Elsevier},
year = {2016},
url = {https://doi.org/10.1016/j.entcs.2016.09.044},
doi = {10.1016/J.ENTCS.2016.09.044},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/Statman16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/Statman16a,
author = {Rick Statman},
editor = {Lars Birkedal},
title = {How to Think of Intersection Types as Cartesian Products},
booktitle = {The Thirty-second Conference on the Mathematical Foundations of Programming
Semantics, {MFPS} 2016, Carnegie Mellon University, Pittsburgh, PA,
USA, May 23-26, 2016},
series = {Electronic Notes in Theoretical Computer Science},
volume = {325},
pages = {305--312},
publisher = {Elsevier},
year = {2016},
url = {https://doi.org/10.1016/j.entcs.2016.09.045},
doi = {10.1016/J.ENTCS.2016.09.045},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entcs/Statman16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Statman14,
author = {Rick Statman},
title = {On polymorphic types of untyped terms},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {6},
pages = {1163--1173},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.04.008},
doi = {10.1016/J.JCSS.2014.04.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Statman14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/Statman14,
author = {Rick Statman},
editor = {Gilles Dowek},
title = {Near Semi-rings and Lambda Calculus},
booktitle = {Rewriting and Typed Lambda Calculi - Joint International Conference,
{RTA-TLCA} 2014, Held as Part of the Vienna Summer of Logic, {VSL}
2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8560},
pages = {410--424},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08918-8\_28},
doi = {10.1007/978-3-319-08918-8\_28},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/Statman14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/corr/Statman15,
author = {Rick Statman},
editor = {Jakob Rehof},
title = {A Finite Model Property for Intersection Types},
booktitle = {Proceedings Seventh Workshop on Intersection Types and Related Systems,
{ITRS} 2014, Vienna, Austria, 18 July 2014},
series = {{EPTCS}},
volume = {177},
pages = {1--9},
year = {2014},
url = {https://doi.org/10.4204/EPTCS.177.1},
doi = {10.4204/EPTCS.177.1},
timestamp = {Wed, 12 Sep 2018 01:05:15 +0200},
biburl = {https://dblp.org/rec/journals/corr/Statman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0032840,
author = {Hendrik Pieter Barendregt and
Wil Dekkers and
Richard Statman},
title = {Lambda Calculus with Types},
series = {Perspectives in logic},
publisher = {Cambridge University Press},
year = {2013},
url = {http://www.cambridge.org/de/academic/subjects/mathematics/logic-categories-and-sets/lambda-calculus-types},
isbn = {978-0-521-76614-2},
timestamp = {Wed, 12 Mar 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0032840.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Statman13,
author = {Rick Statman},
editor = {Simona Ronchi Della Rocca},
title = {A New Type Assignment for Strongly Normalizable Terms},
booktitle = {Computer Science Logic 2013 {(CSL} 2013), {CSL} 2013, September 2-5,
2013, Torino, Italy},
series = {LIPIcs},
volume = {23},
pages = {634--652},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.CSL.2013.634},
doi = {10.4230/LIPICS.CSL.2013.634},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/Statman13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/IntrigilaS11,
author = {Benedetto Intrigila and
Richard Statman},
title = {Solution to the Range Problem for Combinatory Logic},
journal = {Fundam. Informaticae},
volume = {111},
number = {2},
pages = {203--222},
year = {2011},
url = {https://doi.org/10.3233/FI-2011-560},
doi = {10.3233/FI-2011-560},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/IntrigilaS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/Statman11,
author = {Rick Statman},
editor = {Lev D. Beklemishev and
Ruy J. G. B. de Queiroz},
title = {On Polymorphic Types of Untyped Terms},
booktitle = {Logic, Language, Information and Computation - 18th International
Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6642},
pages = {239--256},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20920-8\_24},
doi = {10.1007/978-3-642-20920-8\_24},
timestamp = {Tue, 01 Jun 2021 15:22:31 +0200},
biburl = {https://dblp.org/rec/conf/wollic/Statman11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/Statman10,
author = {Rick Statman},
editor = {Michael W. Mislove and
Peter Selinger},
title = {Cartesian Monoids},
booktitle = {Proceedings of the 26th Conference on the Mathematical Foundations
of Programming Semantics, {MFPS} 2010, Ottawa, Ontario, Canada, May
6-10, 2010},
series = {Electronic Notes in Theoretical Computer Science},
volume = {265},
pages = {437--451},
publisher = {Elsevier},
year = {2010},
url = {https://doi.org/10.1016/j.entcs.2010.08.026},
doi = {10.1016/J.ENTCS.2010.08.026},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/entcs/Statman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-1374,
author = {Benedetto Intrigila and
Richard Statman},
title = {The Omega Rule is {\(\Pi\)}\({}_{\mbox{1}}\)\({}^{\mbox{1}}\)-Complete
in the {\(\lambda\)}{\(\beta\)}-Calculus},
journal = {Log. Methods Comput. Sci.},
volume = {5},
number = {2},
year = {2009},
url = {http://arxiv.org/abs/0903.1374},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-1374.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Statman07,
author = {Rick Statman},
title = {On the complexity of alpha conversion},
journal = {J. Symb. Log.},
volume = {72},
number = {4},
pages = {1197--1203},
year = {2007},
url = {https://doi.org/10.2178/jsl/1203350781},
doi = {10.2178/JSL/1203350781},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Statman07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tlca/IntrigilaS07,
author = {Benedetto Intrigila and
Richard Statman},
editor = {Simona Ronchi Della Rocca},
title = {The Omega Rule is P\({}_{\mbox{1}}\)\({}^{\mbox{1}}\)-Complete in
the \emph{lambdabeta} -Calculus},
booktitle = {Typed Lambda Calculi and Applications, 8th International Conference,
{TLCA} 2007, Paris, France, June 26-28, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4583},
pages = {178--193},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73228-0\_14},
doi = {10.1007/978-3-540-73228-0\_14},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/tlca/IntrigilaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/IntrigilaS06,
author = {Benedetto Intrigila and
Richard Statman},
title = {Solution of a Problem of Barendregt on Sensible lambda-Theories},
journal = {Log. Methods Comput. Sci.},
volume = {2},
number = {4},
year = {2006},
url = {https://doi.org/10.2168/LMCS-2(4:5)2006},
doi = {10.2168/LMCS-2(4:5)2006},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/IntrigilaS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609080,
author = {Benedetto Intrigila and
Richard Statman},
title = {Solution of a Problem of Barendregt on Sensible lambda-Theories},
journal = {CoRR},
volume = {abs/cs/0609080},
year = {2006},
url = {http://arxiv.org/abs/cs/0609080},
eprinttype = {arXiv},
eprint = {cs/0609080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/IntrigilaS05,
author = {Benedetto Intrigila and
Richard Statman},
title = {Some results on extensionality in lambda calculus},
journal = {Ann. Pure Appl. Log.},
volume = {132},
number = {2-3},
pages = {109--125},
year = {2005},
url = {https://doi.org/10.1016/j.apal.2003.05.001},
doi = {10.1016/J.APAL.2003.05.001},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/IntrigilaS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/StatmanB05,
author = {Richard Statman and
Henk Barendregt},
editor = {Aart Middeldorp and
Vincent van Oostrom and
Femke van Raamsdonk and
Roel C. de Vrijer},
title = {B{\"{o}}hm's Theorem, Church's Delta, Numeral Systems, and Ershov
Morphisms},
booktitle = {Processes, Terms and Cycles: Steps on the Road to Infinity, Essays
Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {3838},
pages = {40--54},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11601548\_5},
doi = {10.1007/11601548\_5},
timestamp = {Mon, 16 Sep 2019 15:30:34 +0200},
biburl = {https://dblp.org/rec/conf/birthday/StatmanB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/Statman05,
author = {Richard Statman},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {Two Variables Are Not Enough},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {406--409},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_32},
doi = {10.1007/11560586\_32},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/Statman05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Statman04,
author = {Richard Statman},
title = {On the lambda\emph{Y} calculus},
journal = {Ann. Pure Appl. Log.},
volume = {130},
number = {1-3},
pages = {325--337},
year = {2004},
url = {https://doi.org/10.1016/j.apal.2004.04.004},
doi = {10.1016/J.APAL.2004.04.004},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Statman04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/IntrigilaS04,
author = {Benedetto Intrigila and
Richard Statman},
title = {The Omega Rule is II{\_}2{\^{}}0-Hard in the lambda beta -Calculus},
booktitle = {19th {IEEE} Symposium on Logic in Computer Science {(LICS} 2004),
14-17 July 2004, Turku, Finland, Proceedings},
pages = {202--210},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/LICS.2004.1319614},
doi = {10.1109/LICS.2004.1319614},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/IntrigilaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Statman02,
author = {Richard Statman},
title = {On The Lambda {Y} Calculus},
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
22-25 July 2002, Copenhagen, Denmark, Proceedings},
pages = {159--166},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LICS.2002.1029825},
doi = {10.1109/LICS.2002.1029825},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Statman02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Statman01,
author = {Richard Statman},
title = {Marginalia to a Theorem of Jacopini},
journal = {Fundam. Informaticae},
volume = {45},
number = {1-2},
pages = {117--121},
year = {2001},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi45-1-2-06},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Statman01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/Statman00,
author = {Richard Statman},
editor = {Michel Parigot and
Andrei Voronkov},
title = {Church's Lambda Delta Calculus},
booktitle = {Logic for Programming and Automated Reasoning, 7th International Conference,
{LPAR} 2000, Reunion Island, France, November 11-12, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1955},
pages = {293--307},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44404-1\_19},
doi = {10.1007/3-540-44404-1\_19},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/lpar/Statman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/Statman00,
author = {Richard Statman},
editor = {Leo Bachmair},
title = {On the Word Problem for Combinators},
booktitle = {Rewriting Techniques and Applications, 11th International Conference,
{RTA} 2000, Norwich, UK, July 10-12, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1833},
pages = {203--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10721975\_14},
doi = {10.1007/10721975\_14},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/Statman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jfp/StatmanB99,
author = {Richard Statman and
Henk Barendregt},
title = {Applications of Plotkin-Terms: Partitions and Morphisms for Closed
Terms},
journal = {J. Funct. Program.},
volume = {9},
number = {5},
pages = {565--575},
year = {1999},
url = {https://doi.org/10.1017/s0956796899003548},
doi = {10.1017/S0956796899003548},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jfp/StatmanB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/Statman99,
author = {Richard Statman},
title = {On the existence of n but not n + 1 easy combinators},
journal = {Math. Struct. Comput. Sci.},
volume = {9},
number = {4},
pages = {361--365},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=44807},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/Statman99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tlca/Statman99,
author = {Richard Statman},
editor = {Jean{-}Yves Girard},
title = {Consequences of Jacopini's Theorem: Consistent Equalities and Equations},
booktitle = {Typed Lambda Calculi and Applications, 4th International Conference,
TLCA'99, L'Aquila, Italy, April 7-9, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1581},
pages = {355--364},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48959-2\_25},
doi = {10.1007/3-540-48959-2\_25},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/tlca/Statman99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Statman98,
author = {Richard Statman},
editor = {Georg Gottlob and
Etienne Grandjean and
Katrin Seyr},
title = {Morphisms and Partitions of V-sets},
booktitle = {Computer Science Logic, 12th International Workshop, {CSL} '98, Annual
Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1584},
pages = {313--322},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10703163\_21},
doi = {10.1007/10703163\_21},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Statman98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/NarendranPS97,
author = {Paliath Narendran and
Frank Pfenning and
Richard Statman},
title = {On the Unification Problem for Cartesian Closed Categories},
journal = {J. Symb. Log.},
volume = {62},
number = {2},
pages = {636--647},
year = {1997},
url = {https://doi.org/10.2307/2275552},
doi = {10.2307/2275552},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/NarendranPS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rta/Statman97,
author = {Richard Statman},
editor = {Hubert Comon},
title = {Effective Reduction and Conversion Strategies for Combinators},
booktitle = {Rewriting Techniques and Applications, 8th International Conference,
RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1232},
pages = {299--307},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62950-5\_79},
doi = {10.1007/3-540-62950-5\_79},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/rta/Statman97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Statman96,
author = {Richard Statman},
editor = {Dirk van Dalen and
Marc Bezem},
title = {On Cartesian Monoids},
booktitle = {Computer Science Logic, 10th International Workshop, {CSL} '96, Annual
Conference of the EACSL, Utrecht, The Netherlands, September 21-27,
1996, Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {1258},
pages = {446--459},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-63172-0\_55},
doi = {10.1007/3-540-63172-0\_55},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Statman96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman93,
author = {Richard Statman},
title = {Some Examples of Non-Existent Combinators},
journal = {Theor. Comput. Sci.},
volume = {121},
number = {1{\&}2},
pages = {441--448},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90096-C},
doi = {10.1016/0304-3975(93)90096-C},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/NarendranPS93,
author = {Paliath Narendran and
Frank Pfenning and
Richard Statman},
title = {On the Unification Problem for Cartesian Closed Categories},
booktitle = {Proceedings of the Eighth Annual Symposium on Logic in Computer Science
{(LICS} '93), Montreal, Canada, June 19-23, 1993},
pages = {57--63},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/LICS.1993.287600},
doi = {10.1109/LICS.1993.287600},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/NarendranPS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ZhangSS92,
author = {Kaizhong Zhang and
Richard Statman and
Dennis E. Shasha},
title = {On the Editing Distance Between Unordered Labeled Trees},
journal = {Inf. Process. Lett.},
volume = {42},
number = {3},
pages = {133--139},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90136-J},
doi = {10.1016/0020-0190(92)90136-J},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ZhangSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/LiguoroPS92,
author = {Ugo de'Liguoro and
Adolfo Piperno and
Richard Statman},
title = {Retracts in simply typed lambda-beta-eta-calculus},
booktitle = {Proceedings of the Seventh Annual Symposium on Logic in Computer Science
{(LICS} '92), Santa Cruz, California, USA, June 22-25, 1992},
pages = {461--469},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/LICS.1992.185557},
doi = {10.1109/LICS.1992.185557},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/LiguoroPS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Statman91,
author = {Richard Statman},
title = {Freyd's Hierarchy of Combinator Monoids},
booktitle = {Proceedings of the Sixth Annual Symposium on Logic in Computer Science
{(LICS} '91), Amsterdam, The Netherlands, July 15-18, 1991},
pages = {186--190},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/LICS.1991.151643},
doi = {10.1109/LICS.1991.151643},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Statman91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FurstGS89,
author = {Merrick L. Furst and
Jonathan L. Gross and
Richard Statman},
title = {Genus distributions for two classes of graphs},
journal = {J. Comb. Theory {B}},
volume = {46},
number = {1},
pages = {22--36},
year = {1989},
url = {https://doi.org/10.1016/0095-8956(89)90004-X},
doi = {10.1016/0095-8956(89)90004-X},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FurstGS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/Statman89,
author = {Richard Statman},
title = {The Word Problem for Smullyan's Lark Combinator is Decidable},
journal = {J. Symb. Comput.},
volume = {7},
number = {2},
pages = {103--112},
year = {1989},
url = {https://doi.org/10.1016/S0747-7171(89)80044-6},
doi = {10.1016/S0747-7171(89)80044-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/Statman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman89,
author = {Richard Statman},
title = {On Sets of Solutions to Combinator Equations},
journal = {Theor. Comput. Sci.},
volume = {66},
number = {1},
pages = {99--104},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90148-5},
doi = {10.1016/0304-3975(89)90148-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SaksS88,
author = {Michael E. Saks and
Rick Statman},
title = {An intersection problem for finite automata},
journal = {Discret. Appl. Math.},
volume = {21},
number = {3},
pages = {245--255},
year = {1988},
url = {https://doi.org/10.1016/0166-218X(88)90070-4},
doi = {10.1016/0166-218X(88)90070-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SaksS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/CherniavskyVS88,
author = {John C. Cherniavsky and
Mahendran Velauthapillai and
Richard Statman},
editor = {David Haussler and
Leonard Pitt},
title = {Inductive Inference: An Abstract Approach},
booktitle = {Proceedings of the First Annual Workshop on Computational Learning
Theory, {COLT} '88, Cambridge, MA, USA, August 3-5, 1988},
pages = {251--266},
publisher = {{ACM/MIT}},
year = {1988},
url = {http://dl.acm.org/citation.cfm?id=93097},
timestamp = {Fri, 23 Dec 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/CherniavskyVS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/popl/MeyerMMS87,
author = {Albert R. Meyer and
John C. Mitchell and
Eugenio Moggi and
Richard Statman},
title = {Empty Types in Polymorphic Lambda Calculus},
booktitle = {Conference Record of the Fourteenth Annual {ACM} Symposium on Principles
of Programming Languages, Munich, Germany, January 21-23, 1987},
pages = {253--262},
publisher = {{ACM} Press},
year = {1987},
url = {https://doi.org/10.1145/41625.41648},
doi = {10.1145/41625.41648},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/popl/MeyerMMS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Statman86,
author = {Richard Statman},
title = {Solving functional equations at higher types: some examples and some
theorems},
journal = {Notre Dame J. Formal Log.},
volume = {27},
number = {1},
pages = {66--74},
year = {1986},
url = {https://doi.org/10.1305/ndjfl/1093636524},
doi = {10.1305/NDJFL/1093636524},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/Statman86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PasztorS86,
author = {Ana Pasztor and
Richard Statman},
title = {Scott Induction and Closure under omega-Sups},
journal = {Theor. Comput. Sci.},
volume = {43},
pages = {251--263},
year = {1986},
url = {https://doi.org/10.1016/0304-3975(86)90179-9},
doi = {10.1016/0304-3975(86)90179-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PasztorS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman86,
author = {Richard Statman},
title = {Every Countable Poset is Embeddable in the Poset of Unsolvable Terms},
journal = {Theor. Comput. Sci.},
volume = {48},
number = {3},
pages = {95--100},
year = {1986},
url = {https://doi.org/10.1016/0304-3975(86)90085-X},
doi = {10.1016/0304-3975(86)90085-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Statman86,
author = {Richard Statman},
title = {On Translating Lambda Terms into Combinators; The Basis Problem},
booktitle = {Proceedings of the Symposium on Logic in Computer Science {(LICS}
'86), Cambridge, Massachusetts, USA, June 16-18, 1986},
pages = {378--382},
publisher = {{IEEE} Computer Society},
year = {1986},
timestamp = {Thu, 22 Jan 2015 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Statman86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Statman85,
author = {Richard Statman},
title = {Logical Relations and the Typed lambda-Calculus},
journal = {Inf. Control.},
volume = {65},
number = {2/3},
pages = {85--97},
year = {1985},
url = {https://doi.org/10.1016/S0019-9958(85)80001-2},
doi = {10.1016/S0019-9958(85)80001-2},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/Statman85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeeriDFS84,
author = {Catriel Beeri and
Martin Dowd and
Ronald Fagin and
Richard Statman},
title = {On the Structure of Armstrong Relations for Functional Dependencies},
journal = {J. {ACM}},
volume = {31},
number = {1},
pages = {30--46},
year = {1984},
url = {https://doi.org/10.1145/2422.322414},
doi = {10.1145/2422.322414},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeeriDFS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Statman83,
author = {Richard Statman},
title = {\emph{{\(\lambda\)}}-definable functionals and\emph{{\(\beta\)}{\(\eta\)}}
conversion},
journal = {Arch. Math. Log.},
volume = {23},
number = {1},
pages = {21--26},
year = {1983},
url = {https://doi.org/10.1007/BF02023009},
doi = {10.1007/BF02023009},
timestamp = {Sat, 26 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Statman83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LewisS82,
author = {Harry R. Lewis and
Richard Statman},
title = {Unifiability is Complete for co-NLogSpace},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {220--222},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90121-1},
doi = {10.1016/0020-0190(82)90121-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LewisS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Statman82,
author = {Richard Statman},
title = {Topological subgraphs of cubic graphs and a theorem of dirac},
journal = {J. Graph Theory},
volume = {6},
number = {4},
pages = {419--427},
year = {1982},
url = {https://doi.org/10.1002/jgt.3190060406},
doi = {10.1002/JGT.3190060406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Statman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Statman82,
author = {Richard Statman},
title = {Completeness, Invariance and lambda-Definability},
journal = {J. Symb. Log.},
volume = {47},
number = {1},
pages = {17--26},
year = {1982},
url = {https://doi.org/10.2307/2273377},
doi = {10.2307/2273377},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Statman82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Statman81,
author = {Richard Statman},
title = {Reductions of the graph reconstruction conjecture},
journal = {Discret. Math.},
volume = {36},
number = {1},
pages = {103--107},
year = {1981},
url = {https://doi.org/10.1016/0012-365X(81)90177-1},
doi = {10.1016/0012-365X(81)90177-1},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Statman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman81,
author = {Richard Statman},
title = {On the Existence of Closed Terms in the Typed lambda Calculus {II:}
Transformations of Unification Problems},
journal = {Theor. Comput. Sci.},
volume = {15},
pages = {329--338},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90086-4},
doi = {10.1016/0304-3975(81)90086-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Statman81,
author = {Richard Statman},
title = {Number Theoretic Functions Computable by Polymorphic Programs (Extended
Abstract)},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {279--282},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.24},
doi = {10.1109/SFCS.1981.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Statman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Statman80,
author = {Richard Statman},
title = {Solution to a problem of Chang and Lee},
journal = {Notre Dame J. Formal Log.},
volume = {21},
number = {3},
pages = {518--520},
year = {1980},
url = {https://doi.org/10.1305/ndjfl/1093883175},
doi = {10.1305/NDJFL/1093883175},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/Statman80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Statman80,
author = {Richard Statman},
title = {Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {1},
pages = {104--110},
year = {1980},
url = {https://doi.org/10.1137/0209008},
doi = {10.1137/0209008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Statman80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman79,
author = {Richard Statman},
title = {Intuitionistic Propositional Logic is Polynomial-Space Complete},
journal = {Theor. Comput. Sci.},
volume = {9},
pages = {67--72},
year = {1979},
url = {https://doi.org/10.1016/0304-3975(79)90006-9},
doi = {10.1016/0304-3975(79)90006-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Statman79a,
author = {Richard Statman},
title = {The Typed lambda-Calculus is not Elementary Recursive},
journal = {Theor. Comput. Sci.},
volume = {9},
pages = {73--81},
year = {1979},
url = {https://doi.org/10.1016/0304-3975(79)90007-0},
doi = {10.1016/0304-3975(79)90007-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Statman79a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/scc/GourlayRS79,
author = {John S. Gourlay and
William C. Rounds and
Richard Statman},
editor = {Gilles Kahn},
title = {On Properties Preserved by Contraction of Concurrent Systems},
booktitle = {Semantics of Concurrent Computation, Proceedings of the International
Symposium, Evian, France, July 2-4, 1979},
series = {Lecture Notes in Computer Science},
volume = {70},
pages = {51--65},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/BFb0022463},
doi = {10.1007/BFB0022463},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/scc/GourlayRS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Statman77,
author = {Richard Statman},
title = {The Typed lambda-Calculus Is not Elementary Recursive},
booktitle = {18th Annual Symposium on Foundations of Computer Science, Providence,
Rhode Island, USA, 31 October - 1 November 1977},
pages = {90--94},
publisher = {{IEEE} Computer Society},
year = {1977},
url = {https://doi.org/10.1109/SFCS.1977.34},
doi = {10.1109/SFCS.1977.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Statman77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
