| Searching for fokkinga. |
531 citations found. Only retrieving 125 citations (System busy - maximum reduced). Only a fraction of citations to each article may be shown. Retrieving citations...
Context Doc 202 (7): Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In Hughes, J., ed.: Proc. of 5th ACM Conf. on Functional Programming Languages and Computer Architecture, FPCA '91. Vol. 523 of Lect. Notes in Comput. Sci. Springer-Verlag, Berlin (1991) 124--144
Context Doc 82 (2): Fokkinga, M.: Law and Order in Algorithmics. PhD thesis. Dept. of Informatics, Univ. of Twente (1992)
Context Doc 48 (2): Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In John Hughes, editor, Functional Programming Languages and Computer Architecture, volume 523 of Lecture Notes in Computer Science, pages 124--144. Springer-Verlag, 1991.
Context Doc 35 (0): Maarten Fokkinga. Monadic maps and folds for arbitrary datatypes. Dept INF, Univ Twente, June 1994.
Context Doc 15 (3): H. Balsters and M. M. Fokkinga, "Subtyping can have a simple semantics," Theoretical Computer Science 87, September 1991, pp. 81-96.
Context Doc 14 (0): Maarten M. Fokkinga. A gentle introduction to category theory --- the calculational approach. In Lecture Notes of the STOP 1992 Summerschool on Constructive Algorithmics, pages 1--72 of Part 1. University of Utrecht, September 1992.
Context Doc 11 (1): M. M. Fokkinga and E. Meijer. Program calculation properties of continuous algebras. Technical Report CS-R9104, CWI, Amsterdam, Jan. 1991.
Context Doc 10 (1): M. Fokkinga. Tupling and mutumorphisms. Squiggolist, 1(4), 1989.
Context Doc 7 (2): M.M. Fokkinga Calculate Categorically! Formal Aspects of Computing(1992) Vol 4, pp 673-692.
Context Doc 5 (0): M.M. Fokkinga, Tupling and Mutamorphisms, The Squiggolist, 1(4) 1989.
Context Doc 4 (2): Maarten M. Fokkinga. Datatype laws without signatures. Mathematical Structures in Computer Science, 6(1):1--32, 1996. Obtainable by ftp://ftp.cs.utwente.nl/pub/doc/ Parlevink/fokkinga/mmf91h.ps.Z.
Context Doc 3 (1): ) Fokkinga, M., Jeuring, J., Meertens, L., and Meijer, E. A translation from attribute grammars to catamorphisms. Squiggolist (Nov. 1990), 1--6. Calculating Accumulations 23
Context Doc 3 (0): L. Fokkinga, M.H. Glastra, and H. Huizinga. LAD - Het lineair ontwikkelen van informatiesystemen. Academic Service, Schoonhoven, The Netherlands, 2nd edition, 1996. In Dutch. ISBN 9039504008
Context Doc 3 (0): M. Fokkinga, M. Poel, and J. Zwiers. Modular completeness for communication closed layers. In Best [11], pages 50-65.
Context Doc 3 (0): M. Fokkinga, J. Jeuring, L. Meertens, and E. Meijer. A translation from attribute grammers to catamorphisms. Squiggolist, pages 1--6, November 1990.
Context Doc 2 (1): Maarten Fokkinga, Johan Jeuring, Lambert Meertens, and Erik Meijer. Translating attribute grammars into catamorphism. The Squiggolist, 2(1), 1991.
Context Doc 2 (3): Maarten Fokkinga. Datatype laws without signatures. Appears in [21]. 61
Context Doc 2 (0): E.Meijer, M.Fokkinga, R. Paterson: Functional programming with bananas, lenses, envelopes and barbed wire. In: J. Hughes (ed.): Functional programming and computer architecture. Lecture Notes in Computer Science 523. Berlin: Springer 1991, 124--144
Context Doc 2 (0): C. Bron, M. M. Fokkinga, and A. C. M. de Haas. A proposal for dealing with abnormal termination of programs. Memorandum 150, Twente University of Technology, The Netherlands, November 1976.
Context Doc 1 (2): M.M. Fokkinga. Calculate categorically! Formal Aspects of Computing, 4(4):673--692, 1992. Obtainable by ftp://ftp.cs.utwente.nl/ pub/doc/Parlevink/fokkinga/mmf91j.ps.Z.
Context Doc 1 (2): M.M. Fokkinga. Abstracte datatypen en categorie-theorie. Memoranda Informatica 9432, University of Twente, June 1994. Obtainable by ftp://ftp.cs.utwente.nl/pub/doc/ Parlevink/fokkinga/mmf94e.ps.Z.
Context Doc 1 (0): Maarten M. Fokkinga A Gentle Introduction to Category Theory - the calculational approach. 1992. http://www.cs.utwente.nl/~fokkinga/mmf92b.pdf (16.05.2005)
Context Doc 1 (0): E. Meijer, M. Fokkinga, and R. Paterson, Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, Proc. 1991 Conference on Functional Programming Languages and Computer Architecture (FPCA'91), Lecture Notes in Computer Science, Vol. 523, pp. 124--144, Springer-Verlag (1991).
Context Doc 1 (0): Maarten M. Fokkinga (1996). Datatype Lawes without Signatures. Math. Struct. in Comp. Sci. 6, pp. 1-32, Cambridge Univ. Press.
Context Doc 1 (0): FOKKINGA, M. Algorithmic synthesis of the Unification Algorithm. Unpublished manuscript. 1989.
Context Doc 1 (0): E. Brinksma, G. Scollo, and C. Steenbergen. LOTOS specifications, their implementations and their tests. In G. Bochmann and B. Sarikaya, editors, Protocol Specification, Testing 18 R.Eshuis and M.M.Fokkinga / Comparing Refinements for Failure and Bisimulation Semantics and Verification VI, pages 349--360. North-Holland, 1987.
Context Doc 1 (0): Fokkinga, M. (1996) "Expressions That Talk About Themselves," Computer Journal, 39(5), pp408--412.
Context Doc 1 (0): M. Fokkinga and R. Eshuis. Comparing rfinements for failure and bisimulation semantics. Technical report, Faculty of Computing Science, Enschede, 2000.
Context Doc 1 (0): M. M. Fokkinga, "An Exercise in Transformational Programming," Science of Computer Programming 16, pp. 19--47, 1991.
Context Doc 1 (0): M.M. Fokkinga, J.T. Jeuring, L. Meertens, E. Meijer: A translation form attribute grammars to catamorhisms. The Squiggolist, 2(1):20-26, 1991.
Context Doc 1 (0): Elements of combinatory logic, Yale University Press, New Heaven. Fokkinga, M.M.
Context Doc 1 (0): M.M. Fokkinga Law and Order in Algorithmics Ph.D. thesis, University of Twente, Dept. INF, Enschede, The Netherlands. 1992. 13
Context Doc 1 (0): M. Fokkinga. An exercise in transformational programming: Backtracking and branch-and-bound. Science of Computer Programming, 16:19--48, 1991.
Context Doc 1 (0): Mawrten M. Fokkinga, Law and Order in A1gorithmics, thesis.
Context Doc 1 (0): M. Fokkinga, J. Jeuring, L. Meertens, E. Meijer, Translation of Attribute Grammars into Catamorphisms, to appear in The Squiggolist, 1991.
Context Doc 1 (0): R. Wieringa, H. Blanken, M. Fokkinga, and P. Grefen. Aligning Application Architecture to the Business Context. In Proceedings CAISE03, 2003. 10
Context Doc 1 (0): C. Bron and M. M. Fokkinga. Exchanging robustness of a program for a relaxation of its specification. Memorandum 178, Twente University of Technology, The Netherlands, September 1977.
Context Doc 1 (0): M.M. Fokkinga. Using underspecification in the derivation of some optimal partition algorithms. CWI, Amsterdam, 1990.
Context Doc 1 (0): MM Fokkinga, E Meijer, J Jeuring, L Meertens [1992], "FRATS: a parallel reduction strategy for shared memory," The Squiggolist 2, 20--26, KG Langendoen & WG Vree.
Context Doc 0 (4): R. van Rein and M.M. Fokkinga. Protocol assuring universal language. accepted for FMOODS '99, 1998.
Context Doc 0 (1): M.M. Fokkinga. A summary of refinement theory. June 1994.
Context Doc 0 (3): M.M. Fokkinga. Law and Order in Algorithmics. PhD thesis, University of Twente, dept Comp Sc, Enschede, The Netherlands, 1992.
Context Doc 0 (1): M.M. Fokkinga. Some self-reproducing Algol-like programs and Kleene's recursion theorem formulated in concrete programming languages. Technical Report TW-memo 281, University of Twente, Enschede, Netherlands, September 1979.
Context Doc 0 (1): M.M. Fokkinga. A self-reproducing Algol 60 program. Algol Bulletin, 35:24--26, 1973.
Context Doc 0 (1): M.M. Fokkinga. Backtracking and branch-and-bound functionally expressed. In Computing Science in the Netherlands, SION congres 1987.
Context Doc 0 (3): E. Strijbos and M.M. Fokkinga. Personal communication, 1998.
Context Doc 0 (1): R. van Rein and M.M. Fokkinga. Protocol Assuring Universal Language. Proceedings of the 1999 conference on Formal Methods for Distributed Object Oriented Systems, 1999.
Context Doc 0 (1): Fokkinga, M.M.: "Programming Language Concepts -- the Lambda Calculus Approach"; in: Essays on Concepts, Formalisms, and Tools (eds. Asveld, Nijholt), CWI Tract 42, CWI, Amsterdam, 1987, pp. 129-162.
First 50 documents Next 50
The numbers before each article are the number of citations (excluding self-citations), and the predicted number of self-citations. 531 citations were found, of which 56 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