The Experts below are selected from a list of 21 Experts worldwide ranked by ideXlab platform

Onesoon Her - One of the best experts on this subject based on the ideXlab platform.

  • Argument Function mismatches in mandarin resultatives a lexical mapping account
    Lingua, 2007
    Co-Authors: Onesoon Her
    Abstract:

    Abstract This paper seeks to account for the Argument-Function mismatches observed in Mandarin resultative compound verbs. The account is formulated within a revised Lexical Mapping Theory (LMT) which incorporates a unified mapping principle. Under the simplest and also the strictest interpretation of this mapping principle (or the θ -Criterion), a composite role, formed by two composing roles, receives syntactic assignment via one composing role only; the second composing role is thus suppressed. Argument-Function mismatches are due to the competition between composing roles for syntactic assignment. This LMT account also facilitates a natural explanation of markedness among the competing syntactic structures.

  • Argument Function mismatches in mandarin chinese a lexical mapping account
    2005
    Co-Authors: Onesoon Her
    Abstract:

    This paper accounts for the Argument-Function mismatches observed in two types of verbs in Mandarin Chinese: resultative compound verbs and verbs of consumption. After a review of Li’s (1995, 1999) causative hierarchy account, I present an alternative formulated in a simplified Lexical Mapping Theory (LMT) with a unified mapping principle, in LFG. Under the strictest and also the simplest interpretation of this mapping principle (similarly the θ-criterion in the derivational framework), only one composing role of a composite role (formed by two composing roles) is allowed syntactic assignment; the other must be suppressed. The Argument-Function mismatches are thus due to the competition between composing roles for syntactic Function assignment. The core data covered are in (1) and (2); expanded data will be discussed in the actual paper. The sentence in (1) illustrates the three-way Argument-Function mapping allowed by resultative compounds. Of particular interest is (1d), where an apparent subject-object inversion is observed, and (2b) shows a similar inversion with verbs of consumption.

  • Argument Function linking in resultatives
    Concentric： Studies in Linguistics, 2004
    Co-Authors: Onesoon Her
    Abstract:

    This paper challenges one prominent common feature in Carrier and Randall's (1992) account of English resultative constructions and Li's (1995) account of Chinese resultative compounds: a weakening of the θ-Criterion by allowing more than one theta role to be assigned to an Argument position. While accepting the Argument structures and the constituent structures these two papers have argued for, this paper demonstrates that strict one-to-one Argument-Function linking should not and need not be relaxed and how it is maintained in an account formulated in a simplified lexical mapping theory of LFG, where a feature structure interfaces between the constituent structure and the Argument structure. The account of Chinese resultatives hinges upon role suppression, a notion independently motivated; the account of English resultatives relies on Functional control, also an independently motivated notion.

S S Marchenkov - One of the best experts on this subject based on the ideXlab platform.

  • iteration operators on a set of continuous Functions of baire space
    Moscow University Computational Mathematics and Cybernetics, 2011
    Co-Authors: S S Marchenkov
    Abstract:

    Continuous Functions on Baire space are considered. Iteration operators are defined on a set of continuous Functions. The idea of a module of continuity of a Function is introduced. The condition for the growth of module of continuity φ whose satisfaction guarantees that for any enumerable sequence of integration operators and any natural n there exists (n + 1) Argument Function with the module of continuity φ which cannot be obtained from n-Argument Functions with the module of continuity φ using any operator of this sequence is formulated. Examples of iteration operators are given.

Zdancewic Steve - One of the best experts on this subject based on the ideXlab platform.

  • Structural Operational Semantics for Control Flow Graph Machines
    2018
    Co-Authors: Garbuzov Dmitri, Mansky William, Rizkallah Christine, Zdancewic Steve
    Abstract:

    Compilers use control flow graph (CFG) representations of low-level programs because they are suited to program analysis and optimizations. However, formalizing the behavior and metatheory of CFG programs is non-trivial: CFG programs don't compose well, their semantics depends on auxiliary state, and, as a consequence, they do not enjoy a simple equational theory that can be used for reasoning about the correctness of program transformations. Lambda-calculus-based intermediate representations, in contrast, have well-understood operational semantics and metatheory, including rich equational theories, all of which makes them amenable to formal verification. This paper establishes a tight equivalence between (a variant of) Levy's call-by-push-value (CBPV) calculus and a control flow graph machine whose instructions are in static single assignment (SSA) form. The correspondence is made precise via a series of abstract machines that align the transitions of the structural operational semantics of the CBPV language with the computation steps of the SSA form. The target machine, which is derived from the CBPV language, accurately captures the execution model of control flow graphs, including direct jumps, mutually recursive code blocks, and multi-Argument Function calls, and the closure-free subset is similar to the SSA intermediate representations found in modern compilers such as LLVM and GCC. The definitions of all the language/abstract machine semantics and the theorems relating them are fully verified in Coq

Shrjie Liu - One of the best experts on this subject based on the ideXlab platform.

  • when serial Arguments predict harm examining the influences of Argument Function topic of the Argument perceived resolvability and Argumentativeness
    Argumentation and Advocacy, 2011
    Co-Authors: Amy Janan Johnson, Joshua M Averbeck, Katherine M Kelley, Shrjie Liu
    Abstract:

    This study examines features of serial Arguments that predict whether these Arguments lead to perceived relational harm and perceived harm to the arguing individual. Similar variables predicted perceived personal and relational harm from a serial Argument. Personal-issue Arguments with low levels of perceived resolvability had higher levels of perceived harm than public-issue Arguments. The two types of Arguments did not differ in perceived harm at levels of high perceived resolvability. Whether the Argument Functioned to resolve behavioral incompatibility was positively related to both relational and personal harm. The Function of gaining and giving knowledge was negatively related to relational harm, and the Function of portraying oneself in a positive light was positively related to personal harm. Low and conflicted-feeling moderate Argumentatives had higher levels of perceived personal harm from the serial Argument than high and apathetic moderate Argumentatives. High Argumentatives perceived less rel...

Garbuzov Dmitri - One of the best experts on this subject based on the ideXlab platform.

  • Structural Operational Semantics for Control Flow Graph Machines
    2018
    Co-Authors: Garbuzov Dmitri, Mansky William, Rizkallah Christine, Zdancewic Steve
    Abstract:

    Compilers use control flow graph (CFG) representations of low-level programs because they are suited to program analysis and optimizations. However, formalizing the behavior and metatheory of CFG programs is non-trivial: CFG programs don't compose well, their semantics depends on auxiliary state, and, as a consequence, they do not enjoy a simple equational theory that can be used for reasoning about the correctness of program transformations. Lambda-calculus-based intermediate representations, in contrast, have well-understood operational semantics and metatheory, including rich equational theories, all of which makes them amenable to formal verification. This paper establishes a tight equivalence between (a variant of) Levy's call-by-push-value (CBPV) calculus and a control flow graph machine whose instructions are in static single assignment (SSA) form. The correspondence is made precise via a series of abstract machines that align the transitions of the structural operational semantics of the CBPV language with the computation steps of the SSA form. The target machine, which is derived from the CBPV language, accurately captures the execution model of control flow graphs, including direct jumps, mutually recursive code blocks, and multi-Argument Function calls, and the closure-free subset is similar to the SSA intermediate representations found in modern compilers such as LLVM and GCC. The definitions of all the language/abstract machine semantics and the theorems relating them are fully verified in Coq