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

Victor Mitrana - One of the best experts on this subject based on the ideXlab platform.

Simona Ronchi Della Rocca - One of the best experts on this subject based on the ideXlab platform.

  • solvability in resource lambda calculus
    Foundations of Software Science and Computation Structure, 2010
    Co-Authors: Michele Pagani, Simona Ronchi Della Rocca
    Abstract:

    The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a Finite Multiset of resources, which in turn can be either linear or reusable, giving rise to non-deterministic choices, expressed by a formal sum. Using the λ-calculus terminology, we call solvable a term that can interact with the environment: solvable terms represent meaningful programs. Because of the non-determinism, different definitions of solvability are possible in the resource calculus. Here we study the optimistic (angelical, or may) notion, and so we define a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity. We give a syntactical, operational and logical characterization of this kind of solvability.

  • FoSSaCS - Solvability in resource lambda-calculus
    Foundations of Software Science and Computational Structures, 2010
    Co-Authors: Michele Pagani, Simona Ronchi Della Rocca
    Abstract:

    The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a Finite Multiset of resources, which in turn can be either linear or reusable, giving rise to non-deterministic choices, expressed by a formal sum. Using the λ-calculus terminology, we call solvable a term that can interact with the environment: solvable terms represent meaningful programs. Because of the non-determinism, different definitions of solvability are possible in the resource calculus. Here we study the optimistic (angelical, or may) notion, and so we define a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity. We give a syntactical, operational and logical characterization of this kind of solvability.

Manfred Kudlek - One of the best experts on this subject based on the ideXlab platform.

Wanderley Pereira - One of the best experts on this subject based on the ideXlab platform.

  • Resonance sequences and recoverability
    International Journal of Number Theory, 2015
    Co-Authors: Lev Birbrair, Marlon Gomes, Wanderley Pereira
    Abstract:

    Let a = {a1,…, ak} be a Finite Multiset of positive integers. Consider the sequence of all positive integer multiples of all ais, and note the multiplicity of each term in this sequence. This sequence of multiplicities is called the resonance sequence generated by {a1,…, ak}. Two Multisets are called combinatorially equivalent if they generate the same resonance sequence. Sometimes the initial set can be recovered from the resonance sequence, if we assume some additional information. These sets are called recoverable. The paper gives some criteria of recoverability for a rather generic class of generating sets.

Michele Pagani - One of the best experts on this subject based on the ideXlab platform.

  • solvability in resource lambda calculus
    Foundations of Software Science and Computation Structure, 2010
    Co-Authors: Michele Pagani, Simona Ronchi Della Rocca
    Abstract:

    The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a Finite Multiset of resources, which in turn can be either linear or reusable, giving rise to non-deterministic choices, expressed by a formal sum. Using the λ-calculus terminology, we call solvable a term that can interact with the environment: solvable terms represent meaningful programs. Because of the non-determinism, different definitions of solvability are possible in the resource calculus. Here we study the optimistic (angelical, or may) notion, and so we define a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity. We give a syntactical, operational and logical characterization of this kind of solvability.

  • FoSSaCS - Solvability in resource lambda-calculus
    Foundations of Software Science and Computational Structures, 2010
    Co-Authors: Michele Pagani, Simona Ronchi Della Rocca
    Abstract:

    The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a Finite Multiset of resources, which in turn can be either linear or reusable, giving rise to non-deterministic choices, expressed by a formal sum. Using the λ-calculus terminology, we call solvable a term that can interact with the environment: solvable terms represent meaningful programs. Because of the non-determinism, different definitions of solvability are possible in the resource calculus. Here we study the optimistic (angelical, or may) notion, and so we define a term solvable whenever there is a simple head context reducing the term into a sum where at least one addend is the identity. We give a syntactical, operational and logical characterization of this kind of solvability.