Results 31 to 40 of about 27,790 (125)
Coordination in Tree Adjoining Grammars: Formalization and Implementation
, 1996 In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG).
Joshi, Aravind, Sarkar, Anoop
core +1 more source
Slot Games for Detecting Timing Leaks of Programs
, 2013 In this paper we describe a method for verifying secure information flow of programs, where apart from direct and indirect flows a secret information can be leaked through covert timing channels. That is, no two computations of a program that differ only
Dimovski, Aleksandar S.
core +2 more sources
A simple sequent calculus for nominal logic [PDF]
, 2013 Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values ...
Cheney, James
core
Asymptotic Symmetries, Holography and Topological Hair
, 2017 Asymptotic symmetries of AdS$_4$ quantum gravity and gauge theory are derived by coupling the dual CFT$_3$ to Chern-Simons gauge theory and 3D gravity in a "probe" large-level limit.
Mishra, Rashmish K., Sundrum, Raman
core +1 more source
Scaffolding in Narrative Learning: Appraisal Analysis in Teachers' Talk [PDF]
, 2020 Engagement is one of appraisal dimensions introduced by Martin and White (2005) that is used to analyze the stances which a teacher takes, both in relation to the students and the visual-verbal components in texts and the way of the teacher align or dis ...
Cahyono, S. P. (Setyo) +1 more
core
The use of sequencing information in software specification for verification [PDF]
, 1983 Software requirements specifications, virtual machine definitions, and algorithmic design all place constraints on the sequence of operations that are permissible during a program's execution.
Osterweil, Leon J., Taylor, Richard N.
core +1 more source
, 2011 We consider two styles of proof calculi for a family of tense logics, presented in a formalism based on nested sequents. A nested sequent can be seen as a tree of traditional single-sided sequents.
Alwen Tiu +13 more
core +1 more source
Comparing and evaluating extended Lambek calculi [PDF]
, 2015 Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a logical theory ...
Moot, Richard
core +3 more sources
Computational coverage of type logical grammar: The Montague test [PDF]
, 2016 It is nearly half a century since Montague made his contributions to the field of logical semantics. In this time, computational linguistics has taken an almost entirely statistical turn and mainstream linguistics has adopted an almost entirely non ...
Morrill, Glyn +1 more
core
The Role of Indexing in Subject Retrieval [PDF]
, 1975 On first reading the list of speakers proposed for this institute, I became aware of being rather the "odd man out" for two reasons. Firstly, I was asked to present a paper on PRECIS which is very much a verbal indexing system-at a conference ...
Austin, Derek
core