Scalable Fine-Grained Proofs for Formula Processing Haniel Barbosa1,2(B) , Jasmin Christian Blanchette3,1,4 , and Pascal Fontaine1 1 Université de Lorraine, CNRS, Inria, LORIA, Nancy, France

Source URL: pxtp.github.io

• Mathematical logic
• Logic
• Mathematics
• Predicate logic
• Computability theory
• Models of computation
• First-order logic
• Lambda calculus
• Term
• Quantifier
• Natural deduction
• CurryHoward correspondence

A New Family of Pairing-Friendly Elliptic Curves Michael Scott and Aurore Guillevic MIRACL.com Université de Lorraine, CNRS, Inria, LORIA, Nancy, France WAIFI 2018, Bergen, Norway, June 14–16

Source URL: caramba.inria.fr

• Geometry
• Mathematics
• Space
• Analytic number theory
• Elliptic curve
• Group theory
• Curve

Making Automatic Theorem Provers more Versatile Simon Cruanes University of Lorraine, CNRS, Inria, LORIA, 54000 Nancy, France Abstract We argue that automatic theorem provers should become more versatile and should be ab

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Software engineering
• Mathematical software
• Formal methods
• Logic in computer science
• Proof assistants
• Automated theorem proving
• Automated reasoning
• Satisfiability modulo theories
• E theorem prover
• ACL2
• Isabelle

PDF Document

Source URL: bu.univ-lorraine.fr

PDF Document

Source URL: www.msh-lorraine.fr

PDF Document

Source URL: iutsd.univ-lorraine.fr

PDF Document

Source URL: poincare.univ-lorraine.fr

PDF Document

Source URL: iutsd.univ-lorraine.fr

PDF Document

Source URL: iutsd.univ-lorraine.fr

PDF Document

Source URL: www.msh-lorraine.fr