#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2010

2017

- This year (1)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David Baelde, Dale Miller, Zachary Snow
- IJCAR
- 2010

Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system for a first-order logic with inductive and co-inductive definitions in which the introduction rules are partitioned into an asynchronous phase and a synchronous phase. These focused proofs… (More)

- Zachary Snow, David Baelde, Gopalan Nadathur
- PPDP
- 2010

Dependently typed λ-calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the Twelf system is based on such an interpretation of LF. We consider here whether a conventional… (More)

Dependently typed λ-calculi such as the Edinburgh Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and their proofs. Such calculi can also be given a logic programming interpretation: the system is based on such an interpretation of LF. We have considered whether a conventional… (More)

- Zachary Snow
- ICLP
- 2010

- Zi Li, Thiya Mukherjee, +5 authors Maor Bar-Peled
- The Journal of biological chemistry
- 2017

Bacterial glycan structures on cell surfaces are critical for cell-cell recognition and adhesion and in host-pathogen interactions. Accordingly, unraveling the sugar composition of bacterial cell surfaces can shed light on bacterial growth and pathogenesis. Here, we found that two rare sugars with a 3-C-methyl-6-deoxyhexose structure were linked to spore… (More)

- Zachary Snow, David Baelde, Gopalan Nadathur
- ArXiv
- 2010

Dependently typed λ-calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the “formulas-as-types” notion, such calculi can also encode the correspondence between formulas and their proofs in typing judgments. As such, these calculi provide a natural yet powerful means for specifying… (More)

- ‹
- 1
- ›