• Publications
  • Influence
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
TLDR
JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. Expand
  • 51
  • 7
  • PDF
HRLSim: A High Performance Spiking Neural Network Simulator for GPGPU Clusters
TLDR
This paper describes a spiking neural network simulator environment called HRL Spiking Simulator (HRLSim) that is suitable for implementation on a cluster of general purpose graphical processing units (GPGPUs). Expand
  • 39
  • 4
MetaPRL - A Modular Logical Environment
TLDR
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. Expand
  • 65
  • 2
  • PDF
Sequent Schema for Derived Rules
TLDR
This paper presents a general sequent schema language that can be used for specifying sequent-style rules for a logical theory. Expand
  • 22
  • 2
Fast Tactic-Based Theorem Proving
TLDR
We present a new modular proving architecture that significantly increases the speed of the core logic engine, with speedups of more than two orders of magnitude over traditional tactic-based proof search. Expand
  • 22
  • 2
  • PDF
A computational approach to reflective meta-reasoning about languages with bindings
TLDR
We present a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Expand
  • 18
  • 2
  • PDF
Quotient Types: A Modular Approach
TLDR
We introduce a new approach to axiomatizing quotient types in type theory. Expand
  • 35
  • 1
  • PDF
Programming Time-Multiplexed Reconfigurable Hardware Using a Scalable Neuromorphic Compiler
TLDR
We describe a neuromorphic system architecture design that addresses an approach to meet these challenges using traditional complementary metal-oxide-semiconductor (CMOS) hardware. Expand
  • 19
  • 1
Markov's Principle for Propositional Type Theory
TLDR
In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov's principle from constructive recursive mathematics to prove termination of specific computations. Expand
  • 21
  • PDF
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
TLDR
We investigate the development of a general-purpose framework for mechanized reasoning about the meta-theory of programming languages in a logical framework, using the same mechanisms for definition, reasoning, and automation that are available to other logics. Expand
  • 12
  • PDF