Kaustuv Chaudhuri

Learn More
Concrete Precedence/ Associativity Types (τ) Atomic types prop, nat, list, . . . Arrow types τ1 → τ2 T1 -> T2 right Terms (m,n) Variables x, y, . . . x, y, . . . Constants c, d, . . . c, d, . . . Nominal constants n1, n2, . . . n1, n2, . . . (n followed by at least one digit) Abstractions λx.m x\ M 0, right λx:τ.m x:T\ M 0, right Applications m n M N 5,(More)
The inverse method is a generalization of resolution that can be applied to non-classical logics. We have recently shown how Andreoli’s focusing strategy can be adapted for the inverse method in linear logic. In this paper we introduce the notion of focusing bias for atoms and show that it gives rise to forward and backward chaining, generalizing both(More)
TLAPS, the TLA proof system, is a platform for the development and mechanical verification of TLA proofs. The TLA proof language is declarative, and understanding proofs requires little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification(More)
The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems that are commonly presented via syntax-directed rules that make use of contexts and side-conditions. The two-level logic approach, as implemented in the Abella theorem prover, embeds the HH specification logic within a rich reasoning logic that(More)
Hypothetical judgments go hand-in-hand with higher-order abstract syntax for meta-theoretic reasoning. The dynamic assumptions of these judgments often have a simple regular structure of repetitions of related assumptions; reflecting on this regular structure can let us derive a number of structural properties about the elements of the context(More)