Benjamin Werner

Orcid: 0000-0002-6857-8699

According to our database1, Benjamin Werner authored at least 28 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the Definition of the Eta-long Normal Form in Type Systems of the Cube.
CoRR, 2023

A constructive proof of Skolem theorem for constructive logic.
CoRR, 2023

Proposed V-Model for Verification, Validation, and Safety Activities for Artificial Intelligence.
Proceedings of the IEEE International Conference on Assured Autonomy, 2023

2022
A drag-and-drop proof tactic.
Proceedings of the CPP '22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17, 2022

2019
Spatially constrained tumour growth affects the patterns of clonal selection and neutral drift in cancer genomic data.
PLoS Comput. Biol., 2019

2018
Variation of mutational burden in healthy human tissues suggests non-random strand segregation and allows measuring somatic mutation rates.
PLoS Comput. Biol., 2018

2015
Certification of real inequalities: templates and sums of squares.
Math. Program., 2015

Formal Proofs for Nonlinear Optimization.
J. Formaliz. Reason., 2015

2013
Certification of Bounds of Non-linear Functions: The Templates Method.
Proceedings of the Intelligent Computer Mathematics, 2013

Certification of inequalities involving transcendental functions: Combining SDP and max-plus approximation.
Proceedings of the 12th European Control Conference, 2013

2012
Neural Implementation of Behavior Control.
Proceedings of the Language Grounding in Robots, 2012

2011
Dynamics of Mutant Cells in Hierarchical Organized Tissues.
PLoS Comput. Biol., 2011

Proof-irrelevant model of CC with predicative induction and judgmental equality
Log. Methods Comput. Sci., 2011

Using Co-existing Attractors of a Sensorimotor Loop for the Motion Control of a Humanoid Robot.
Proceedings of the NCTA 2011, 2011

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2010
Importing HOL Light into Coq.
Proceedings of the Interactive Theorem Proving, First International Conference, 2010

2008
On the Strength of Proof-irrelevant Type Theories.
Log. Methods Comput. Sci., 2008

2007
Simple Types in Type Theory: Deep and Shallow Encodings.
Proceedings of the Theorem Proving in Higher Order Logics, 20th International Conference, 2007

2006
A Computational Approach to Pocklington Certificates in Type Theory.
Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

2005
Arithmetic as a Theory Modulo.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004
Choice in Dynamic Linking.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Proof normalization modulo.
J. Symb. Log., 2003

2002
The Not So Simple Proof-Irrelevant Model of CC.
Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

1997
Sets in Types, Types in Sets.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

1996
A Generic Normalisation Proof for Pure Type Systems.
Proceedings of the Types for Proofs and Programs, 1996

1994
Une Théorie des Constructions Inductives.
PhD thesis, 1994

On the Church-Rosser Property for Expressive Type Systems and its Consequences for their Metatheoretic Study
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
Synthesis of ML Programs in the System Coq.
J. Symb. Comput., 1993


  Loading...