Freek Wiedijk

According to our database1, Freek Wiedijk authored at least 42 papers between 1989 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Coq proof of the correctness of X25519 in TweetNaCl.
IACR Cryptol. ePrint Arch., 2021

2019
A benchmark for C program verification.
CoRR, 2019

Proof-checking Euclid.
Ann. Math. Artif. Intell., 2019

2016
A Probabilistic Analysis of the Game of the Goose.
SIAM Rev., 2016

Preface: Twenty Years of the QED Manifesto.
J. Formaliz. Reason., 2016

2015
Foreword to the Special Focus on Formal Proofs for Mathematics and Computer Science.
Math. Comput. Sci., 2015

A Typed C11 Semantics for Interactive Theorem Proving.
Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

2014
History of Interactive Theorem Proving.
Proceedings of the Computational Logic, 2014

Formal C Semantics: CompCert and the C Standard.
Proceedings of the Interactive Theorem Proving - 5th International Conference, 2014

2013
Explicit convertibility proofs in pure type systems.
Proceedings of the Eighth ACM SIGPLAN International Workshop on Logical Frameworks & Meta-languages: Theory & Practice, 2013

Separation Logic for Non-local Control Flow and Block Scope Variables.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
"Handbook of Practical Logic and Automated Reasoning, " by John R. Harrison, Cambridge University Press, 2009.
J. Autom. Reason., 2012

A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving
Log. Methods Comput. Sci., 2012

2011
A Formalization of the C99 Standard in HOL, Isabelle and Coq.
Proceedings of the Intelligent Computer Mathematics - 18th Symposium, 2011

2010
Preface.
J. Autom. Reason., 2010

Pollack-inconsistency.
Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers, 2010

Pure Type Systems without Explicit Contexts
Proceedings of the Proceedings 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2010

Proviola: A Tool for Proof Re-animation.
Proceedings of the Intelligent Computer Mathematics, 10th International Conference, 2010

2009
Stateless HOL
Proceedings of the Proceedings Types for Proofs and Programs, Revised Selected Papers, 2009

2008
Merging Procedural and Declarative Proof.
Proceedings of the Types for Proofs and Programs, International Conference, 2008

A Real Semantic Web for Mathematics Deserves a Real Semantics.
Proceedings of the 3rd Semantic Wiki Workshop (SemWiki 2008) at the 5th European Semantic Web Conference (ESWC 2008), 2008

2007
Preface to the special issue: Constructive analysis, types and exact real numbers.
Math. Struct. Comput. Sci., 2007

Constructive analysis, types and exact real numbers.
Math. Struct. Comput. Sci., 2007

Mizar's Soft Type System.
Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007

Certified Computer Algebra on Top of an Interactive Theorem Prover.
Proceedings of the Towards Mechanized Mathematical Assistants, 14th Symposium, 2007

2006
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics.
J. Appl. Log., 2006

Introduction.
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2005
The meaning of infinity in calculus and computer algebra systems.
J. Symb. Comput., 2005

2004
A Logical Framework with Explicit Conversions.
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages, 2004

Hierarchical Reflection.
Proceedings of the Theorem Proving in Higher Order Logics, 17th International Conference, 2004

C-CoRN, the Constructive Coq Repository at Nijmegen.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

2003
Formal Proof Sketches.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

First Order Logic with Domain Conditions.
Proceedings of the Theorem Proving in Higher Order Logics, 16th International Conference, 2003

Comparing Mathematical Provers.
Proceedings of the Mathematical Knowledge Management, Second International Conference, 2003

2002
A Constructive Algebraic Hierarchy in Coq.
J. Symb. Comput., 2002

A New Implementation of Automath.
J. Autom. Reason., 2002

A Comparison of Mizar and Isar.
J. Autom. Reason., 2002

2001
Mizar Light for HOL Light.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

2000
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000

Equational Reasoning via Partial Reflection.
Proceedings of the Theorem Proving in Higher Order Logics, 13th International Conference, 2000

1991
Uniform Algebraic Specifications of Finite Sets with Equality.
Int. J. Found. Comput. Sci., 1991

1989
Specification of the Transit Node in PSF<sub>d</sub>.
Proceedings of the Algebraic Methods II: Theory, 1989


  Loading...