BibBase http://www.michaelbeeson.com/research/papers/freek.bib
generated by bibbase.org
  2013 (1)
Separation Logic for Non-local Control Flow and Block Scope Variables. Krebbers, R.; and Wiedijk, F. In Pfenning, F., editor(s), Foundations of Software Science and Computation Structures - 16th International Conference, FOSSACS 2013, volume 7794, of Lecture Notes in Computer Science, pages 257–272, 2013. Springer
Separation Logic for Non-local Control Flow and Block Scope Variables [pdf] pdf   link   bibtex  
  2012 (3)
Review of "Handbook of Practical Logic and Automated Reasoning," by John R. Harrison, Cambridge University Press, 2009. Wiedijk, F. Journal of Automated Reasoning, 49(1): 107–109. 2012.
Review of "Handbook of Practical Logic and Automated Reasoning," by John R. Harrison, Cambridge University Press, 2009 [pdf] pdf   link   bibtex  
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving. Wiedijk, F. Logical Methods in Computer Science, 8(1): 1–26. 2012.
A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving [pdf] pdf   link   bibtex  
Pollack-inconsistency. Wiedijk, F. In Coen, C. S.; and Aspinall, D., editor(s), UITP 2010, 9th International Workshop on User Interfaces for Theorem Provers, volume 285, of ENTCS, pages 85-100, 2012.
Pollack-inconsistency [pdf] pdf   link   bibtex  
  2011 (3)
Interactive Theorem Proving, Proceedings of the Second International Conference on Interactive Theorem Proving, ITP 2011, Berg en Dal, The Netherlands. van Eekelen, M.; Geuvers, H.; Schmalz, J.; and Wiedijk, F., editors. Volume 6898, of Lecture Notes in Computer Science.Springer. 2011.
link   bibtex  
A formalization of the C99 standard in HOL, isabelle and Coq. Krebbers, R.; and Wiedijk, F. In Davenport, J.; Farmer, W.; and Rabe, F., editor(s), Intelligent Computer Mathematics, Calculemus 2011 and MKM 2011, volume 6824, of Lecture Notes in Artificial Intelligence, pages 301–303, 2011. Springer
A formalization of the C99 standard in HOL, isabelle and Coq [pdf] pdf   link   bibtex  
Stateless HOL. Wiedijk, F. In Hirschowitz, T., editor(s), Types for Proofs and Programs, TYPES 2009, Revised Selected Papers, EPTCS 53, pages 47–61, 2011.
Stateless HOL [pdf] pdf   link   bibtex  
  2010 (2)
Pure Type Systems without Explicit Contexts. Geuvers, H.; Krebbers, R.; and Wiedijk, J. M. & F. In Crary, K.; and Miculan, M., editor(s), Proceedings of the 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, EPTCS 34, pages 53–67, 2010.
Pure Type Systems without Explicit Contexts [pdf] pdf   link   bibtex  
Proviola: a Tool for Proof Re-animation. Tankink, C.; Geuvers, H.; McKinna, J.; and Wiedijk, F. In S. Autexier, J. C.; Delahaye, D.; Ion, P.; Rideau, L.; Rioboo, R.; and Sexton, A., editor(s), Intelligent Computer Mathematics, 10th International Conference, AISC 2010, 17th Symposium, Calculemus 2010 and 9th International Conference, MKM 2010, volume 6167, of Lecture Notes in Artificial Intelligence, pages 440–454, 2010. Springer
Proviola: a Tool for Proof Re-animation [pdf] pdf   link   bibtex  
  2009 (5)
Statistics on digital libraries of mathematics. Wiedijk, F. Studies in Logic Grammar and Rhetoric, 28(31). 2009.
Statistics on digital libraries of mathematics [pdf] pdf   link   bibtex  
`Many Digits' Friendly Competition. Niqui, M.; and Wiedijk, F. Technical Report ICIS-R09007, University of Nijmegen, 2009.
`Many Digits' Friendly Competition [pdf] pdf   link   bibtex  
Wiskundig onderzoek per computer?. G. Cornelissen, W. d. G.; van der Kallen, W.; Sijsling, J.; de Smit, B.; Stevens, J.; and Wiedijk, F. Nieuw Archief voor Wiskunde, 5/10(3): 197–200. 2009.
Wiskundig onderzoek per computer? [pdf] pdf   link   bibtex  
Practising logic through the web. Wiedijk, F. Nieuwsbrief van de NVTI, 13: 61–68. 2009.
Practising logic through the web [pdf] pdf   link   bibtex  
Formalizing Arrow's theorem. Wiedijk, F. Sadhana, 34(1): 193–220. 2009.
Formalizing Arrow's theorem [pdf] pdf   link   bibtex  
  2008 (5)
Formal proof–getting started. Wiedijk, F. Notices of the American Mathematical Society, 55(11): 1408–1414. 2008.
Formal proof–getting started [pdf] pdf   link   bibtex  
Position paper: A real Semantic Web for mathematics deserves a real semantics. Corbineau, P.; Geuvers, H.; Kaliszyk, C.; McKinna, J.; and Wiedijk, F. In Lange, C.; Schaffer, S.; Skaf-Molli, H.; and Völkel, M., editor(s), Proceedings of the 3rd Semantic Wiki Workshop (SemWiki 2008) at the 5th European Semantic Web Conference (ESWC 2008), 2008.
Position paper: A real Semantic Web for mathematics deserves a real semantics [pdf] pdf   link   bibtex  
Deduction using the ProofWeb system. Cezary Kaliszyk, F. v. R.; Wiedijk, F.; Wupper, H.; Hendriks, M.; and de Vrijer, R. Technical Report ICIS-R08016, Radboud University Nijmegen, 2008.
Deduction using the ProofWeb system [pdf] pdf   link   bibtex  
De kunst van het bewijzen. Wiedijk, F. In Wiskunde en profil, Het gezicht van de wiskunde, Vakantiecursus 2008, pages 107–130, 2008. CWI
De kunst van het bewijzen [pdf] pdf   link   bibtex  
Intelligent Computer Mathematics, 9th International Conference, AISC 2008, 15th Symposium, Calculemus 2008, 7th International Conference, MKM 2008, Birmingham, UK, July 28-August 1, 2008, Proceedings. Wiedijk, F. Volume 5144, of Lecture Notes in Computer Science.Springer. 2008.
link   bibtex  
  2007 (6)
Teaching logic using a state-of-the-art proof assistant. Kaliszyk, C.; Wiedijk, F.; Hendriks, M.; and van Raamsdonk, F. In Courtieu, H. G. & P., editor(s), PATE'07, International Workshop on Proof Assistants and Types in Education, pages 37–50, 2007.
Teaching logic using a state-of-the-art proof assistant [pdf] pdf   link   bibtex  
Programming Languages for Mechanized Mathematics Workshop, Informal Proceedings. Carette, J.; and (editors), F. W. Technical Report 07-10, RISC-Linz, 2007.
link   bibtex  
Mizar's Soft Type System. Wiedijk, F. In Schneider, K.; and Brandt, J., editor(s), Theorem Proving in Higher Order Logics 2007, volume 4732, of Lecture Notes in Artificial Intelligence, pages 383–399, 2007. Springer
Mizar's Soft Type System [pdf] pdf   link   bibtex  
The QED Manifesto Revisited. Wiedijk, F. In Matuszwski, R.; and Zalewska, A., editor(s), From Insight to Proof, Festschrift in Honour of Andrzej Trybulec, pages 121–133, 2007.
The QED Manifesto Revisited [pdf] pdf   link   bibtex  
Certified Computer Algebra on top of an Interactive Theorem Prover. Kaliszyk, C.; and Wiedijk, F. In Kauers, M.; Kerber, M.; Miner, R.; and Windsteiger, W., editor(s), Towards Mechanized Mathematical Assistants, Calculemus 2007, Hagenberg, volume 4573, of Lecture Notes in Artificial Intelligence, 2007. Springer
Certified Computer Algebra on top of an Interactive Theorem Prover [pdf] pdf   link   bibtex  
Constructive analysis, types and exact real numbers. Geuvers, H.; Niqui, M.; Spitters, B.; and Wiedijk, F. Mathematical Structures in Computer Science, 17(1): 3–36. 2007.
Constructive analysis, types and exact real numbers [pdf] pdf   link   bibtex  
  2006 (3)
Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics. Wiedijk, F. Journal of Applied Logic, 4: 622–645. 2006.
Is ZF a hack? Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics [pdf] pdf   link   bibtex  
On the usefulness of formal methods. Wiedijk, F. Nieuwsbrief van de NVTI,14–23. 2006.
On the usefulness of formal methods [pdf] pdf   link   bibtex  
Bewijzen: romantisch of cool. Barendregt, H.; and Wiedijk, F. Euclides. 2006.
Bewijzen: romantisch of cool [pdf] pdf   link   bibtex  
  2005 (2)
The Challenge of Computer Mathematics. Barendregt, H.; and Wiedijk, F. Transactions A of the Royal Society, 363(1835): 2351–2375. 2005.
The Challenge of Computer Mathematics [pdf] pdf   link   bibtex  
The meaning of infinity in calculus and computer algebra systems. Beeson, M.; and Wiedijk, F. Journal of Symbolic Computation, 39(5): 523–538. 2005.
The meaning of infinity in calculus and computer algebra systems [pdf] pdf   link   bibtex  
  2004 (4)
Equational Reasoning in Algebraic Structures: a Complete Tactic. Cruz-Filipe, L.; and Wiedijk, F. Technical Report NIII-R0431, University of Nijmegen, 2004.
Equational Reasoning in Algebraic Structures: a Complete Tactic [pdf] pdf   link   bibtex  
A logical framework with explicit conversions. Geuvers, H.; and Wiedijk, F. In Schürmann, C., editor(s), LFM'04, Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages, Cork, Ireland, pages 32–45, 2004.
A logical framework with explicit conversions [pdf] pdf   link   bibtex  
Dutch Proof Tools Day 2004, Program + Proceedings. Wiedijk, F., editor. University of Nijmegen. 2004.
Dutch Proof Tools Day 2004, Program + Proceedings [pdf] pdf   link   bibtex  
Formal proof sketches. Wiedijk, F. In Berardi, S.; Coppo, M.; and Damiani, F., editor(s), Types for Proofs and Programs: Third International Workshop, TYPES 2003, Torino, Italy, volume 3085, of Lecture Notes in Computer Science, pages 378–393, 2004. Springer
Formal proof sketches [pdf] pdf   link   bibtex  
  2003 (4)
MMode, a Mizar Mode for the proof assistant Coq. Giero, M.; and Wiedijk, F. Technical Report NIII-R0333, University of Nijmegen, 2003.
MMode, a Mizar Mode for the proof assistant Coq [pdf] pdf   link   bibtex  
First Order Logic with Domain Conditions. Wiedijk, F.; and Zwanenburg, J. In Basin, D.; and Wolff, B., editor(s), Theorem Proving in Higher Order Logics, Proceedings of TPHOLs 2003, volume 2758, of Lecture Notes in Computer Science, pages 221–237, 2003. Springer
First Order Logic with Domain Conditions [pdf] pdf   link   bibtex  
Formal proof sketches. Wiedijk, F. In Fokkink, W.; and van de Pol, J., editor(s), th Dutch Proof Tools Day, Program + Proceedings, CWI, Amsterdam, 2003, 2003.
Formal proof sketches [pdf] pdf   link   bibtex  
Comparing mathematical provers. Wiedijk, F. In Asperti, A.; Buchberger, B.; and Davenport, J., editor(s), Mathematical Knowledge Management, Proceedings of MKM 2003, pages 188–2002, 2003.
Comparing mathematical provers [pdf] pdf   link   bibtex  
  2002 (4)
Types for Proofs and Programs, International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002. Geuvers, H.; and Wiedijk, F., editors. of Lecture Notes in Computer Science.Springer. 2002.
link   bibtex  
A comparison of the mathematical proof languages Mizar and Isar. Wenzel, M.; and Wiedijk, F. Journal of Automated Reasoning,3889–411. 2002.
A comparison of the mathematical proof languages Mizar and Isar [pdf] pdf   link   bibtex  
A new implementation of Automath. Wiedijk, F. Journal of Automated Reasoning, 29: 365–387. 2002.
A new implementation of Automath [pdf] pdf   link   bibtex  
A Constructive Algebraic Hierarchy in Coq. Geuvers, H.; Wiedijk, F.; and Zwanenburg, J. Journal of Symbolic Computation,271–286. 2002.
A Constructive Algebraic Hierarchy in Coq [pdf] pdf   link   bibtex  
  2001 (2)
A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals. Geuvers, H.; Wiedijk, F.; and Zwanenburg, J. In Callaghan, P.; Luo, Z.; McKinna, J.; and Pollack, R., editor(s), Types for Proofs and Programs, Proceedings of the International Workshop, TYPES 2000, Durham, volume 2277, of Lecture Notes in Computer Science, pages 96–111, 2001. Springer
A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals [pdf] pdf   link   bibtex  
Mizar Light for HOL Light. Wiedijk, F. In Boulton, R.; and Jackson, P., editor(s), Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs 2001, Edinburgh, volume 2152, of Lecture Notes in Computer Science, pages 378–393, 2001. Springer
Mizar Light for HOL Light [pdf] pdf   link   bibtex  
  2000 (1)
Equational Reasoning via Partial Reflection. Geuvers, H.; Wiedijk, F.; and Zwanenburg, J. In Harrison, J.; and Aagaard, M., editor(s), Theorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000, Portland, Oregon, volume 1869, of Lecture Notes in Computer Science, pages 162–178, 2000.
Equational Reasoning via Partial Reflection [pdf] pdf   link   bibtex  
  1991 (3)
Persistence in Algebraic Specifications. Wiedijk, F. Ph.D. Thesis, University of Amsterdam, 1991.
Persistence in Algebraic Specifications [pdf] pdf   link   bibtex  
Specification of the transit node in PSFd. Mauw, S.; and Wiedijk, F. In Bergstra, J. A.; and Feijs, L., editor(s), Algebraic Methods II: Theory, Tools and Applications, volume 490, of Lecture Notes in Computer Science, pages 341–361. Springer, 1991.
link   bibtex  
Uniform algebraic specifications of finite sets with equality. Bergstra, J. A.; Mauw, S.; and Wiedijk, F. International Journal of Foundations of Computer Science, 1(2): 43–65. 1991.
link   bibtex  
  1986 (1)
Conforme supergravitatie zonder constraints. Wiedijk, F. Master's thesis, University of Amsterdam, 1986.
Conforme supergravitatie zonder constraints [pdf] pdf   link   bibtex  
  1983 (1)
Some metrical observations on the approximation by continued fractions. Bosma, W.; Jager, H.; and Wiedijk, F. Indagnationes Mathematica, 45: 281–299. 1983.
link   bibtex  
  undefined (1)
The Seventeen Provers of the World. Wiedijk, F., editor. Volume 3600 of Lecture Notes in Artificial IntelligenceSpringer, .
link   bibtex