Wykaz cytowań. Marek Zaionc Wydział Matematyki i Informatyki, Uniwersytet Jagielloński, - PDF

Description
maj 2016 Prof. dr hab. Marek Zaionc phone: (48 12) Theoretical Computer Science fax: (48 12) Jagiellonian University, secretary: (48 12) ul. Łojasiewicza 6, web-page:

Please download to get full document.

View again

of 21
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Information
Category:

Religious & Philosophical

Publish on:

Views: 27 | Pages: 21

Extension: PDF | Download: 0

Share
Transcript
maj 2016 Prof. dr hab. Marek Zaionc phone: (48 12) Theoretical Computer Science fax: (48 12) Jagiellonian University, secretary: (48 12) ul. Łojasiewicza 6, web-page: Kraków, Poland. Wykaz cytowań Marek Zaionc Wydział Matematyki i Informatyki, Uniwersytet Jagielloński, Cytowane prace podane są w porządku chronologicznym. Numeracja cytowanych prac jest zgodna z numeracja podaną w Curriculum Vitae. Lista nie zawiera autocytowań. Literą (M) zaznaczone są cytowania występujące w przeglądowych monografiach. Lista zawiera 220 cytowań. 4. Marek Zaionc The set of Unifiers in Typed lambda calculus as Regular Expression Lecture Notes in Computer Science 202, Springer-Verlag, May 1985, pp (13 cytowań) 1. Lawrence C. Paulson, Natural Deduction Proof as Higher-Order Resolution University of Cambridge Computer Laboratory Reports 82, Wayne Snyder i Jean Gallier Higher - Order Unification Revisited: Complete Sets of Transformations Journal of Symbolic Computations (1989) Jorg Siekman Unification Theory Journal of Symbolic Computation (1989) Lawrence C. Paulson Natural Deduction Proof as Higher-Order Resolution Journal of logic Programming 3, (1986 ) (M) D.A. Wolfram The Clasual Theory of Types volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press Gilles Dowek. Third order matching is decidable. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS-7), pages 2 10, IEEE Computer Society Press, 7. Sabine Broda, Luis Damas Counting a Type s Principal Inhabitants Lecture Notes in Computer Science 1581 (1999), pp (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science Sabine Broda, Luis Damas Counting a Type s (Principal) Inhabitants Fundamenta Informaticae 45 (2001), pp G. Dowek, Third order matching is decidable, Annals of Pure and Applied Logic, 69 (1994), pp Sabine Brada, Luis Damas, Habitantes principais normais et T A λ, Technical Report Series: DCC-0004, Departamento de Ciencia de Comptadores, Universidade de Porto, Portugal. 12. Mateu Villaret, PhD thesis On Some Variants of Second-Order Unification obroniona w Universitat Polititecnica de Catalunya Programa de Doctorat en Software, maj Michael Chan, Doctor of Philosophy thesis Ontology Evolution in Physics, Centre for Intelligent Systems and their Applications, School of Informatics University of Edinburgh https://www.era.lib.ed.ac.uk/handle/1842/7907 Marek Zaionc Gramatyki termów w lambda rachunku z Typami Praca doktorska Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki (1985) (1 cytowanie) 14. Wil Dekkers Reducibility of Types in Typed Lambda Calculus Information and Computations vol 77 No Marek Zaionc The Regular Expression Descriptions of Unifier Sets in the Typed λcalculus Fundamenta Informaticae X (1987) North-Holland pp (5 cytowań) 15. (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science (M) G. Dowek, Higher order Unification and Matching, in HANDBOOK OF AUTOMATED REASONING Alan Robinson, and Andreai Voronkov Eds. 2001, pp 17. G. Huet, Higher Order Unification 30 years later, Lecture Notes in Computer Science 2410, pp Tomer Líbal, Unification in Higher-order Resolution, DISSERTATION partial fulfillment of the requirements for the degree of Doktor/in der technischen Wissenschaften, Faculty of Informatics at the Vienna University of Technology, Advisor: Univ.Prof. Dr.phil. Alexander Leitsch, item Tomer Libal, Regular Patterns in Second-order Unification, submitted. 7. Marek Zaionc Word Operations Definable in the Typed λcalculus Theoretical Computer Science 52 (1987) North-Holland pp (16 cytowań) 19. Daniel Leivant Subrecursion and lambda representation over free algebras Feasible Mathematics, Perspectives in Computer Science Birkhauser-Boston, New York 1990, pp Malgorzata Madry Lambda representability of Integer, Word, and Tree functions Fundamenta Informaticae 17, D. Leivant, Joun-Yves Marion Lambda calculus characterization of polytime Lecture Notes in Computer Science 664, 1993, pp (M) D.A. Wolfram The Clasual Theory of Types volume 21 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press Michael Kohlhase A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle, Published as: Doctoral Thesis, Universit at des Saarlandes, Saarbrucken, Germany, M. Takahashi, Y Akama, S. Hirokawa Normal Proofs and their Grammar Lecture Notes in Computer Science vol 789 pp , Daniel Leivant, J-Y Marion Lambda Calculus Characterization of Poly Time Fundamenta Informaticae 19 (1990) M. Takahashi, Y. Akama, S. Hirokawa Normal Proofs and their Grammar Information and Computation vol. 125 March , pp (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science Takahashi M., λ-representable functions over free structures revisited. Third Fuji International Symposium on Functional and Logic Programming (Kyoto, 1998), 1 19, World Sci. Publishing, River Edge, NJ, 29. Danner N, Ordinals and ordinal functions representable in the simply typed lambda calculus ANNALS OF PURE AND APPLIED LOGIC 1997: (1-3) MARCH Takahashi, Masako Lambda-representable functions over term algebras. Special issue on functional and logic programming, Part 1 (Kyoto, 1998). Internat. J. Found. Comput. Sci. 12 (2001), no. 1, William Blum, The Safe Lambda Calculus, PhD thesis at Oxford University Computing Laboratory, 2008 (http://web.comlab.ox.ac.uk/people/william.blum/index.html) 32. William Blum, C.-H. Luke Ong, The Safe Lambda Calculus, Logical Methods in Computer Science, vol 5 (1), 2009 pp Paweł Parys, How many numbers contains a lambda-term? Conference: 12th International Symposium on Functional and Logic Programming (FLOPS) Location: Kanazawa, JAPAN Date: JUN 04-06, 2014 Assoc Comp Machinery SIGPLAN; Asian Assoc Fdn Software; Assoc Log Programming FUNCTIONAL AND LOGIC PROGRAMMING, FLOPS 2014 Book Series: Lecture Notes in Computer Science Volume: 8475 Pages: Published: Paweł Parys, A Characterization of Lambda-terms Transforming Numbers, J. Functional Programming, Marek Zaionc Mechanical Procedure for Proof Construction via Closed Terms in Typed λcalculus, Journal of Automated Reasoning 4 (1988), Reidel Publ, pp (14 cytowań ) 35. Masami Hagiya Higher Order Unification as Theorem Proving Procedure Logic programming (Paris, 1991), , MIT Press Ser. Logic Program., MIT Press, Cambridge, MA, (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science C. Munoz. Dependent Type Systems with Explicit Substitutions. PhD thesis, INRIA, César Munoz, Proof-term Synthesis on Dependent-type Systems via Explicit Substitutions, Institute for Computer Applications in Science and Engineering, National Aeronautics and Space Administration Langley Research Center Hampton, Virginia NASA/CR ICA- SE Report No Sabine Broda, Luis Damas Counting a Type s Principal Inhabitants Lecture Notes in Computer Science 1581 (1999), pp 40. (M) G. Dowek, Higher order Unification and Matching, in HANDBOOK OF AUTOMATED REASONING Alan Robinson, and Andreai Voronkov Eds. 2001, pp Sabine Broda, Luis Damas Counting a Type s (Principal) Inhabitants Fundamenta Informaticae 45 (2001), pp Munoz C. Proof-term synthesis on dependent-type systems via explicit substitutions THEORETICAL COMPUTER SCIENCE 266: (1-2) SEP G. Huet. Higher Order Unification 30 years later. Proceedings, 15th International Conference TPHOL Eds V. Carreno, C. Munoz and S. Tahar. Lecture Notes in Computer Science 2410, pp Sabine Brada, Luis Damas, Habitantes principais normais et T A λ, Technical Report Series: DCC-0004, Departamento de Ciencia de Comptadores, Universidade de Porto, Portugal. 45. (M) Sarensen M. and Urzyczyn P. Lectures on the Curry-Howard Isomorphism, Studies in Logic and the Foundations of Mathematics, Elsevier Science, Gilles Dowek and Ying Jiang Enumerating proofs of positive formulae, The Computer Journal,, 2008, doi: /comjnl/bxn Michał H. Pałka, Koen Claessen, Alejandro Russo, John Hughes, Testing an optimising compiler by generating random lambda terms, Proceeding AST 11 Proceedings of the 6th International Workshop on Automation of Software Test, pp 91-97, ACM New York, NY, USA, Paweł Urzyczyn, Intuitionistic Games: Determinacy, Completeness, and Normalization, Studia Logica, vol 104, 2016, pp Marek Zaionc On the lambda definable higher-order boolean functionals Fundamenta Informaticae XII (1989) North-Holland, pp (2 cytowania) 49. Malgorzata Madry Lambda representability of Integer, Word, and Tree functions Fundamenta Informaticae 17, Güyer, T, Mirasyediog A functional computation model for the duality of two-variable Lambda-Boolean functions, Applied Mathematics and Computation Volume 182, Issue 1, 1 November 2006, Pages Marek Zaionc How To Define Functionals on Free Structures in Typed λcalculus Lecture Notes in Computer Science 379, Springer- Verlag, August 1989, pp (1 cytowanie) 5 51. Daniel Leivant Subrecursion and lambda representation over free algebras Feasible Mathematics, Perspectives in Computer Science Birkhauser-Boston, New York 1990, pp Marek Zaionc On the λdefinable tree operations Lecture Notes in Computer Science 425, Springer-Verlag, June 1988, pp (3 cytowania) 52. Daniel Leivant Subrecursion and lambda representation over free algebras Feasible Mathematics, Perspectives in Computer Science Birkhauser-Boston, New York 1990, pp William Blum, The Safe Lambda Calculus, PhD thesis at Oxford University Computing Laboratory, 2008 (http://web.comlab.ox.ac.uk/people/william.blum/index.html) 54. William Blum, C.-H. Luke Ong, The Safe Lambda Calculus, Logical Methods in Computer Science, vol 5 (1), 2009 pp Marek Zaionc A Characterization of Lambda Definable Tree Operations Information and Computation Vol. 89, Academic Press No. 1, 1990 pp (6 cytowań) 55. Daniel Leivant Discrete Polymorhism Proecidings of the Sixth ACM Conference on LISP and Functinal Programming, 1990, Malgorzata Madry Lambda representability of Integer, Word, and Tree functions Fundamenta Informaticae 17, Sachio Hirokawa Infiniteness of Proof(α) is Polynomial space Complete Technical Report TR-CS-92, Research Institute of Fundamental Information Science, Kyushu University, Fukuoka, Japan, (1994). 58. Takahashi M., λ-representable functions over free structures revisited. Third Fuji International Symposium on Functional and Logic Programming (Kyoto, 1998), 1 19, World Sci. Publishing, River Edge, NJ, (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science Takahashi, Masako Lambda-representable functions over term algebras. Special issue on functional and logic programming, Part 1 (Kyoto, 1998). Internat. J. Found. Comput. Sci. 12 (2001), no. 1, Marek Zaionc Lambda definability on free algebras -Annals of Pure and Applied logic 51, North-Holland, (1991) pp (15 cytowań) 6 61. Daniel Leivant Subrecursion and lambda representation over free algebras Feasible Mathematics, Perspectives in Computer Science Birkhauser-Boston, New York 1990, pp Sachio Hirokawa Infiniteness of Proof(α) is Polynomial space Complete Technical Report TR-CS-92, Research Institute of Fundamental Information Science, Kyushu University, Fukuoka, Japan, (1994). 63. Daniel Leivant Discrete Polymorhism Proecidings of the Sixth ACM Conference on LISP and Functinal Programming, 1990, M. Takahashi, Y Akama, S. Hirokawa Normal Proofs and their Grammar Lecture Notes in Computer Science vol 789 pp , Daniel Leivant Functions over free algebras definable in the simple typed lambda calculus A collection of contributions in honour of Corrado Böhm on the occasion of his 70th birthday. 121 (1993), Theoretical Computer Science no. 1-2, pp Sachio Hirokawa Infiniteness of Proof(α) is Polynomial space Complete Theoret. Comput. Sci. 206 (1998), no. 1-2, M. Takahashi, Y. Akama, S. Hirokawa Normal Proofs and their Grammar Information and Computation vol. 125 March , pp Takahashi M., λ-representable functions over free structures revisited. Third Fuji International Symposium on Functional and Logic Programming (Kyoto, 1998), 1 19, World Sci. Publishing, River Edge, NJ, Danner N, Ordinals and ordinal functions representable in the simply typed lambda calculus ANNALS OF PURE AND APPLIED LOGIC 1997: (1-3) MAR Antonio Bucciarelli, Silvia de Lorenzis, Adolfo Piperno, Ivano Salvo, Some Computational Properties of Intersection Types, 14th Symposium on Logic in Computer Science, July 02-05, 1999 Trento, Italy, p Takahashi, Masako Lambda-representable functions over term algebras. Special issue on functional and logic programming, Part 1 (Kyoto, 1998). Internat. J. Found. Comput. Sci. 12 (2001), no. 1, Bucciarelli Antonio, Piperino Adolfo, Salvo I., Intersection types and lambda definability, Mathematical Structures in Computer Science, (2003) vol 13, pp Mateusz Zakrzewski, Definable functions in the simply typed lambdacalculus, manuscript 74. William Blum, The Safe Lambda Calculus, PhD thesis at Oxford University Computing Laboratory, 2008 (http://web.comlab.ox.ac.uk/people/william.blum/index.html) 7 75. William Blum, C.-H. Luke Ong, The Safe Lambda Calculus, Logical Methods in Computer Science, vol 5 (1), 2009 pp Marek Zaionc Fixpoint Technique for Counting Terms in Typed Lambda Calculus, Technical Report of Department of Computer Science at State University of New York at Buffalo, April (citeseer.nj.nec.com/ html) (7 cytowania) 76. Sachio Hirokawa Infiniteness of Proof(α) is Polynomial space Complete Technical Report TR-CS-92, Research Institute of Fundamental Information Science, Kyushu University, Fukuoka, Japan, (1994). 77. (M) J. Roger Hindley, Basic Simple Type Theory, Cambridge Tracts in Theoretical Computer Science Sachio Hirokawa The number of proofs for implicational formulas Proceedings of Logic Colloquium 92 vol 36 Jonas Bolyai Math Society Sachio Hirokawa Infiniteness of Proof(α) is Polynomial space Complete Theoret. Comput. Sci. 206 (1998), no. 1-2, Volker Sorge Einbindung eines Computeralgebrasystems in eine logische Beweisumgebung, Diplomarbeit, am Fachbereich Mathematik der Universität at des Saarlandes, Sabine Brada, Luis Damas, Habitantes principais normais et T A λ, Technical Report Series: DCC-0004, Departamento de Ciencia de Comptadores, Universidade de Porto, Portugal. 82. J. B. Wells, Boris Yakobowski, GraphBased Proof Counting and Enumeration with Applications for Program Fragment Synthesis, Lecture Notes in Computer Science vol. 3573, pp , Marek Zaionc Lambda definability is decidable for second order types and for regular third order types Report of Department of Computer Science at State University of New York at Buffalo, May 1995,(citeseer.nj.nec.com/88135.html) (1 cytowanie) 83. Kahrs, S., The variable containment problem LECTURE NOTES IN COMPUTER SCIENCE 1074 : , 17. Marek Zaionc Lambda representations of operations between different term algebras, Lecture Notes in Computer Science 933, June 1995 pp (2 cytowania) 8 84. William Blum, The Safe Lambda Calculus, PhD thesis at Oxford University Computing Laboratory, 2008 (http://web.comlab.ox.ac.uk/people/william.blum/index.html) 85. William Blum, C.-H. Luke Ong, The Safe Lambda Calculus, Logical Methods in Computer Science, vol 5 (1), 2009 pp M. Moczurad, J. Tyszkiewicz, M. Zaionc, Statistical properties of simple types Mathematical Structures in Computer Science, vol 10 (2000), pp (28 cytowań) 86. Soza G, Asymptotic density as a method of expressing quantitative relations in Intuitionistic Logic Reports on Mathematical Logic No. 36 (2002), pp Kostrzycka Z, On the Density of Truth of Implicational Parts of Intuitionistic and Classical Logics, Journal of Applied Non-Classical Logics, vol 13, nr. 2, Kostrzycka Z, On the Density of Truth in Grzegorczyk s Modal Logic, Bulletin of the Section of Logic, 33/2, (2004) pp Szczypka E. Object Complexity, SCHEDAE INFORMATICAE, vol 13, 2004, pp Kostrzycka Z, On Formulas with one Variable in some Fragment of Grzegorczyk s Modal Logic, Bulletin of the Section of Logic, 32/2, (2004) pp Danielle Gardy, Alan Woods, And/or tree probabilities of Boolean function Discrete Mathematics and Theoretical Computer Science, (2005) AD pp Grzegorz Matecki, Asymptotic density for equivalence, Electronic Notes in Theoretical Computer Science, volume 140, 2005 pp Szczypka Edward, Object Complexity, rozprawa doktorska na Wydziale Matematyki i Informatyki UJ, Daniele Gardy, Random Boolean Expressions, Discrete Mathematics and Theoretical Computer Science, Proc AF (2006) pp Zofia Kostrzycka, On the density of truth in modal logics, Discrete Mathematics and Theoretical Computer Science, Proc AG (2006) pp Zofia Kostrzycka, The density of truth in monadic fragments of some intermediate logics, Journal Journal of Logic, Language and Information, Issue Volume 16, Number 3 / July, 97. Zofia Kostrzycka, On asymptotic divergency in equivalential logics Mathematical Structures in Computer Science, vol. 18, 2008, pp Moczurad Małgorzata, Moczurad Włodzimierz, Asymptotic density of brick and word codes, Ars Combin., 83 (2007), pp Hervé Fournier, Daniele Gardy, Antoine Genitrini and Bernhard Gittenberger Complexity and Limiting Ratio of Boolean Functions over Implication, volume 5162 of Lecture Notes in Computer Science, pp , Antoine Genitrini, Jakub Kozik, Grzegorz Matecki, On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science, AI pp , Antoine Genitrini, Jakub Kozik, Quantitative comparison of Intuitionistic and Classical logics - full propositional system, LFCS09, Lecture Notes in Computer Science 5407 (2009) pp M. Moczurad, W. Moczurad, How many figure sets are codes?, Lecture Notes in Computer Science 5196, 2008, pp Zofia Kostrzycka, On density of truth of the intuitionistic logic in one variable, Discrete Mathematics and Theoretical Computer Science, AI pp Antoine GENITRINI, Expressions Booléeennes aléatoires: probabilité, complexité et comparaison quantitative de logiques propositionnelles, le grade de Docteur Spécialité: Informatique at Université de Versailles St- Quentin-En-Yvelines, Laboratoire PRiSM Zofia Kostrzycka, On the Density of Truth of Locally Finite Logics Journal of Logic and Computation, December 2009; 19, pp Herve Fournier, Daniele Gardy, Antoine Genitrini, Bernhard Gittenberger The fraction of large random trees representing a given boolean function in implicational logic Random Structures & Algorithms, Volume 40, Issue 3, pages , May Antoine Genitrini, Jakub Kozik, In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid, Annals of Pure and Applied Logic, (7), pp Michał H. Pałka, Koen Claessen, Alejandro Russo, John Hughes, Testing an optimising compiler by generating random lambda terms, Proceeding AST 11 Proceedings of the 6th International Workshop on Automation of Software Test, ACM New York, NY, USA, Laszlo Aszalos and Tamas Herendi, Density of Tautologies in Logics with One Variable, Acta Cybernetica 20 (2012) pp 110. O. Bodinia, D. Gardy, A. Jacquota, Asymptotics and random sampling for BCI and BCK lambda terms, THEORETICAL COMPUTER SCIENCE Volume: 502 Pages: , Michał H. Pałka, Random Structured Test Data Generation for Black-Box Testing, PhD thesis in Department in Computer Science and Engineering, Chalmers University of Gothenburg, Sweden Brigitte Chauvin, Daniele Gardy, Cécile Mailler, A Sprouting Tree Model for Random Boolean Functions, DOI: /rsa.20567, Random Structures & Algorithms View, Article first published online: 31 JUL Hervé Fournier, Complexité du calcul de polynômes et de problèmes géométriques, Mémoire d habilitation à diriger des recherches, rozprawa habilitacyjna, Université Paris Diderot - Paris 7 UFR de Mathématiques, Z. Kostrzycka, M. Zaionc On the density of truth in Dummet logic, Bulletin of the Section of Logic, vol. 32/1 (2003) pp (4
Related Search
Similar documents
View more...
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks