| Searching for PHRASE daniel leivant. |
138 citations found. Retrieving citations...
Context Doc 17 (0): Daniel Leivant. Contracting Proofs to Programs. In Logic and Computer Science, Lecture Notes in Mathematics 1429, ed. P. Odifreddi, pages 279-- 327. 1990.
| Looking for an author? You may be seeing only a fraction of all citations. Try: daniel w/2 leivant or d w/2 leivant (w/2 means within 2 words) |
Context Doc 14 (1): Daniel Leivant. Ramified recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Je#rey Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science, pages 320--343. BirkhauserBoston, New York, 1994.
Context Doc 12 (0): Daniel Leivant. Polymorphic type inference. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, pages 88--98, 1983.
Context Doc 9 (0): Daniel Leivant. Typing and computational properties of lambda expressions. Theoret. Comput. Sci., 44(1):51--68, 1986.
Context Doc 6 (0): Daniel Leivant and Jean-Yves Marion. Lambda calculus characterisations of polytime. Fundamentae Informaticae, 19:167--184, 1993.
Context Doc 5 (1): Daniel Leivant. Stratified Functional Programs and Computational Complexity. In Proc. 20th IEEE Symp. on Principles of Programming Languages, 1993.
Context Doc 5 (0): Daniel Leivant. Polymorphic type inference. In Proc. 10th Symposium on Principles of Programming Languages, 1983.
Context Doc 5 (0): Daniel Leivant. Strati ed functional programs and computational complexity. In Proceedings of 20th ACM Symposium on Principles of Programming Languages, pages 325-333, 1993.
Context Doc 4 (0): Leivant 1989 Daniel Leivant, "Descriptive Characterizations of Computational Complexity", Journal of Computer and System Sciences 39 (1989), 51--83.
Context Doc 4 (0): Daniel Leivant. Syntactic translations and provably recursive functions. The Journal of Symbolic Logic, 50(3):682--688, September 1985.
Context Doc 4 (0): Daniel Leivant. Discrete polymorphism. To appear in Proceedings of Lisp and Functional Programming '90, 1990.
Context Doc 4 (0): Daniel Leivant and Jean-Yves Marion. Rami ed recurrence and computational complexity II: Substitution and poly-space. In Proceedings of 8th International Workshop on Computer Science Logic, pages 486-500, 1994.
Context Doc 3 (0): Daniel Leivant and Jean-Yves Marion. Lambda calculus characterization of poly--time. In M. Bezem and J.F. Groote, editors, Typed Lambda Calculi and Applications, pages 274--288. Springer Lecture Notes in Computer Science Vol. 664, 1993.
Context Doc 3 (0): Steven Fortune, Daniel Leivant, and Michael O'Donnell. The expressiveness of simple and second-order type structures. Journal of the A CM, 30(1):151-185, January 1983.
Context Doc 3 (0): Daniel Leivant. Predicative recurrence and computational complexity I: Word recurrence and poly-time. In Peter Clote and Je ery Remmel, editors, Feasible Mathematrics II. Birkhauser, 1994. 20
Context Doc 3 (0): Leivant, Daniel [1983] Reasoning about functional programs and complexity classes associated with type disciplines, 24th Annual Symposium on Foundations of Computer Science, IEEE, 460--469.
Context Doc 2 (0): Daniel Leivant. Strong normalization for arithmetic (variations on a theme of Prawitz). In J. Diller and G.H. Muller, editors, Proof Theory Symposion Kiel 1974, volume 500 of Lecture Notes in Mathematics, pages 182-197. Springer Verlag, 1975.
Context Doc 2 (0): Daniel Leivant. Predicative recurrence in finite type. In A. Nerode and Y.V. Matiyasevich, editors, Logical Foundations of Computer Science, volume 813 of Springer Lecture Notes in Computer Science, pages 227-- 239, 1994.
Context Doc 2 (0): Daniel Leivant. Characterization of complexity classes in higher-order logic. In Proceedings of the Second Annual Conference on Structure in Complexity Theory, pages 203-217, 1987.
Context Doc 2 (0): Daniel Leivant. Stratified polymorphism. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, Asilomar, California, June 1989.
Context Doc 2 (0): Daniel Leivant. Finitely stratified polymorphism. Technical report CMUCS -90-160, Carnegie Mellon University. August 1990.
Context Doc 2 (0): Daniel Leivant. Intrinsic reasoning about functional programs I. First order theories. To appear in Annals of Pure and Applied Logic.
Context Doc 1 (0): Daniel Leivant. Higher order logic. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Articial Intelligence and Logic Programming, Volume 2: Deduction Methodologies, pages 229-321. Clarendon Press, Oxford, 1994.
Context Doc 1 (0): A. Berthiaume and G. Brassard. The quantum challenge to structural complexity theory. In Osamu Barrington, David Mix; Brassard, Gilles; Hemachandra, Lane; Leivant, Daniel; Chair, Tim Long; Nisan, Noam; Royer, James; Watanabe, editor, Proceedings of the 7th Annual Conference on Structure in Complexity Theory (SCTC '92), pages 132-137, Boston, MA, USA, June 1992. IEEE Computer Society Press.
Context Doc 1 (0): Daniel Leivant. Applicative control and computational complexity. In Proceedings of 13th International Workshop on Computer Science Logic, pages 82-95, 1999.
Context Doc 1 (0): Daniel Leivant. Existential instantiation in a system of natural deduction for intuitionistic arithmetics. Technical report, Stichting Mathematisch Centrum. Note ZW 13/73.
Context Doc 1 (0): Samuel Buss. On Herbrand's theorem. In Daniel Leivant, editor, Logic and Computational Complexity, volume 960 of Lecture Notes in Computer Science, pages 195--209. Springer-Verlag, 1995.
Context Doc 1 (0): Daniel Leivant. Functions over free algebras denable in the simply typed lambda calculus. Theoretical Computer Science, 121:309-321, 1993.
Context Doc 1 (0): St'efane Grumbach, Jianwen Su, and Christophe Tollu. Linear constraint query languages expressive power and complexity. In Daniel Leivant, editor, Proceedings of the International Workshop on Logic and Computational Complexity (LCC'94), Indianapolis, IN, USA, pages 426--446, October.
Context Doc 1 (0): Daniel Leivant, Predicative recurrence in nite type, Logical Foundations of Computer Science (A. Nerode and Y.V. Matiyasevich, eds.), LNCS, vol. 813, 1994, pp. 227-239.
Context Doc 1 (0): S.S. Wainer. The hierarchy of terminating recursive programs over N. In Daniel Leivant, editor, Logic and Computational Complexity, Lecture Notes in Computer Science, Vol. 959, pages 281--299. Springer, Berlin, 1994.
Context Doc 1 (0): Daniel Leivant. Intrinsic theories and computational complexity. In Daniel Leivant, editor, Logic and Computational Complexity, pages 177--194. Springer, Berlin, 1994.
Context Doc 1 (0): U. Berger and H. Schwichtenberg. Program extraction from classical proofs. In Daniel Leivant, editor, Logic and Computational Complexity, pages 77--97. Springer, Berlin, 1994.
Context Doc 1 (0): J. C. Reynolds. The essence of Algol. In J. W. de Bakker and J. C. van Vliet, editors, Algorithmic Languages, pages 345--372. North-Holland, Amsterdam, 1981. 90 Daniel Leivant
Context Doc 1 (0): D. Mundici. Other quantifiers: An overview. In J. Barwise and S. Feferman, editors, Model Theoretic Logic, pages 211--233. NorthHolland, Amsterdam, 1985. 88 Daniel Leivant
Context Doc 1 (0): P. Lindstr¨om. On extensions of elementary logic. Theoria, 35:1--11, 1969. 86 Daniel Leivant
Context Doc 1 (0): D. Kozen and R. Parikh. A decision procedure 84 Daniel Leivant for the propositional ¯-calculus. In Proc. Workshop on Logics of Programs 1983, Volume 164 of LNCS, pages 313--325, Berlin, 1983. SpringerVerlag.
Context Doc 1 (0): A. P. Hazen. Interpretability of Robinson Arithmetic in the 82 Daniel Leivant ramified second-order theory of dense linear order. Notre Dame Journal of Formal Logic, 33:101--111, 1992.
Context Doc 1 (0): H. Friedman. Some systems of second order arithmetic and their use. In Proceedings of the International Congress of Mathematicians (Vancouver, 1974), Volume 1, pages 235--242. Canadian Mathematical Congress, 1975. 80 Daniel Leivant
Context Doc 1 (0): M. Coppo and M. Dezani-Ciancaglini. An extension of basic functionality theory for -calculus. Notre- 78 Daniel Leivant Dame Journal of Formal Logic, 21:685--693, 1980.
Context Doc 1 (0): J. Barwise. Applications of strict ß 1 1 predicates to infinitary logic. Journal of Symbolic Logic, 34:409--423, 1969. 76 Daniel Leivant
Context Doc 1 (0): Daniel Leivant. Finitely stratified polymorphism. Information and Computation, 199? To appear. Available as Technical Report CMU-CS-90-160, School of Computer Science, Carnegie Mellon University.
Context Doc 0 (1): Daniel Leivant. Implicit computational complexity for higher type functionals. In Julian Bradfield, editor, Computer Science Logic 2002.
Context Doc 0 (1): Leiff Daniel Leivant, Predicatived Peano theories and their provable functions, to appear. Leifi Daniel Leivant, Abtraction and computational complexity, to appear. LM93 Daniel Leivant and Jean-Yves Marion, Lambda characterizations of poly-time, Fundamenta Informaticae, Special issue on Typed Lambda Calculi (J. Tiuryn, ed.), 1993.
Context Doc 0 (1): Daniel Leivant. Subrecursion and lambda representation over free algebras. In Samuel Buss and Philip Scott, editors, Feasible Mathematics, Perspectives in Computer Science, pages 281--291. Birkhauser-Boston, New York, 1990.
The numbers before each article are the number of citations (excluding self-citations), and the predicted number of self-citations. 138 citations were found, of which 5 were predicted to be self-citations. Self-citations are not included in the graph.
Try your query at: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC