#### Filter Results:

- Full text PDF available (38)

#### Publication Year

2003

2017

- This year (1)
- Last 5 years (20)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David Baelde, Kaustuv Chaudhuri, +4 authors Yuting Wang
- J. Formalized Reasoning
- 2014

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)

Linear logic presents a unified framework for describing and reasoning about stateful systems. Because of its view of hypotheses as resources, it supports such phenomena as concurrency, external and internal choice, and state transitions that are common in such domains as protocol verification, concurrent computation, process calculi and games. It… (More)

- Kaustuv Chaudhuri, Frank Pfenning, Greg Price
- Journal of Automated Reasoning
- 2006

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)

- Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz
- IJCAR
- 2010

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 focusing theorem identifies a complete class of sequent proofs that have no inessential nondeterministic choices and restrict the essential choices to a particular normal form. Focused proofs are therefore well suited both for the search and for the representation of sequent proofs. The calculus of structures is a proof formalism that allows rules to be… (More)

- Kaustuv Chaudhuri
- CSL
- 2010

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the other direction has no truth-preserving propositional encodings. We show here that subexponential logic, which is a family… (More)

- Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur
- PPDP
- 2013

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)

- Olivier Savary Bélanger, Kaustuv Chaudhuri
- LFMTP
- 2014

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)

We reexamine the foundations of linear logic, developing a system of natural deduction following Martin-Löf’s separation of judgments from propositions. Our construction yields a clean and elegant formulation that accounts for a rich set of multiplicative, additive, and exponential connectives, extending dual intuitionistic linear logic but differing from… (More)

- Kaustuv Chaudhuri
- LPAR
- 2008

It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. We present a sequent calculus of synthetic connectives based on neutral proof patterns, which are a syntactic normal form for such connectives. Different focusing strategies arise from different… (More)