相关论文: Constructing the Propositional Truncation using No…
Verification problems of programs written in various paradigms (such as imperative, logic, concurrent, functional, and object-oriented ones) can be reduced to problems of solving Horn clause constraints on predicate variables that represent…
This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambda calculus with general recursion and equality types. The…
Circumscription is a representative example of a nonmonotonic reasoning inference technique. Circumscription has often been studied for first order theories, but its propositional version has also been the subject of extensive research,…
A simple pseudo-Hamiltonian formulation is proposed for the linear inhomogeneous systems of ODEs. In contrast to the usual Hamiltonian mechanics, our approach is based on the use of non-stationary Poisson brackets, i.e. corresponding…
Homotopy type theory is a formal language for doing abstract homotopy theory -- the study of identifications. But in unmodified homotopy type theory, there is no way to say that these identifications come from identifying the path-connected…
In this paper, we present an adaptive step-size homotopy tracking method for computing bifurcation points of nonlinear systems. There are four components in this new method: 1) an adaptive tracking technique is developed near bifurcation…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…
Simplicial type theory extends homotopy type theory and equips types with a notion of directed morphisms. A Segal type is defined to be a type in which these directed morphisms can be composed. We show that all higher coherences can be…
We show how security type systems from the literature of language-based noninterference can be represented more directly as predicates defined by structural recursion on the programs. In this context, we show how our uniform syntactic…
Hamiltonian Truncation (HT) is a numerical approach for calculating observables in a Quantum Field Theory non-perturbatively. This approach can be applied to theories constructed by deforming a conformal field theory with a relevant…
For A a category with finite colimits, we show that the embedding of A into the category of arrows Arr(A) determined by the initial object is the completion of A under strong homotopy cokernels. The nullhomotopy structure of Arr(A) (needed…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
Punctual noncommutative Hilbert schemes are projective varieties parametrizing finite codimensional left ideals in noncommutative formal power series rings. We determine their motives and intersection cohomology, by constructing affine…
To ensure decidability and consistency of its type theory, a proof assistant should only accept terminating recursive functions and productive corecursive functions. Most proof assistants enforce this through syntactic conditions, which can…
In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision procedure for intuitionistic implicational tautologies. For this…
Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in…
A method for the nonintrusive and structure-preserving model reduction of canonical and noncanonical Hamiltonian systems is presented. Based on the idea of operator inference, this technique is provably convergent and reduces to a…
This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability clo- sure, and bound variables are…