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

Akinori Yonezawa - One of the best experts on this subject based on the ideXlab platform.

  • region based memory management for a Dynamically Typed Language
    Asian Symposium on Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

  • APLAS - Region-Based Memory Management for a Dynamically-Typed Language
    Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

Akihito Nagata - One of the best experts on this subject based on the ideXlab platform.

  • region based memory management for a Dynamically Typed Language
    Asian Symposium on Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

  • APLAS - Region-Based Memory Management for a Dynamically-Typed Language
    Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

Konstantinos Sagonas - One of the best experts on this subject based on the ideXlab platform.

  • IFL - Unboxed compilation of floating point arithmetic in a Dynamically Typed Language environment
    Implementation of Functional Languages, 2003
    Co-Authors: Tobias Lindahl, Konstantinos Sagonas
    Abstract:

    In the context of the Dynamically Typed concurrent functional programming Language ERLANG, we describe a simple static analysis for identifying variables containing floating point numbers, how this information is used by the BEAM compiler, and a scheme for efficient (just-in-time) compilation of floating point bytecode instructions to native code. The attractiveness of the scheme lies in its implementation simplicity. It has been fully incorporated in Erlang/OTP R9, and improves the performance of ERLANG programs manipulating floats considerably. We also show that by using this scheme, Erlang/OTP, despite being an implementation of a Dynamically Typed Language, achieves performance which is competitive with that of state-of-the-art implementations of strongly Typed strict functional Languages on floating point intensive programs.

  • unboxed compilation of floating point arithmetic in a Dynamically Typed Language environment
    Lecture Notes in Computer Science, 2003
    Co-Authors: Tobias Lindahl, Konstantinos Sagonas
    Abstract:

    In the context of the Dynamically Typed concurrent functional programming Language ERLANG, we describe a simple static analysis for identifying variables containing floating point numbers, how this information is used by the BEAM compiler, and a scheme for efficient (just-in-time) compilation of floating point bytecode instructions to native code. The attractiveness of the scheme lies in its implementation simplicity. It has been fully incorporated in Erlang/OTP R9, and improves the performance of ERLANG programs manipulating floats considerably. We also show that by using this scheme, Erlang/OTP, despite being an implementation of a Dynamically Typed Language, achieves performance which is competitive with that of state-of-the-art implementations of strongly Typed strict functional Languages on floating point intensive programs.

N Kobayashi - One of the best experts on this subject based on the ideXlab platform.

  • region based memory management for a Dynamically Typed Language
    Asian Symposium on Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

  • APLAS - Region-Based Memory Management for a Dynamically-Typed Language
    Programming Languages and Systems, 2004
    Co-Authors: Akihito Nagata, N Kobayashi, Akinori Yonezawa
    Abstract:

    Region-based memory management scheme has been proposed for the programming Language ML. In this scheme, a compiler statically estimates the lifetime of each object by performing an extension of type inference (called region inference) and inserts code for memory allocation and deallocation. Advantages of this scheme are that memory objects can be deallocated safely (unlike with manual memory management using malloc/free) and often earlier than with run-time garbage collection. Since the region inference is an extension of the ML type inference, however, it was not clear whether the region-based memory management was applicable to Dynamically-Typed programming Languages like Scheme. In this paper, we show that the region-based memory management can be applied to Dynamically-Typed Languages by combining region inference and Cartwright et al.’s soft type system.

Tobias Lindahl - One of the best experts on this subject based on the ideXlab platform.

  • IFL - Unboxed compilation of floating point arithmetic in a Dynamically Typed Language environment
    Implementation of Functional Languages, 2003
    Co-Authors: Tobias Lindahl, Konstantinos Sagonas
    Abstract:

    In the context of the Dynamically Typed concurrent functional programming Language ERLANG, we describe a simple static analysis for identifying variables containing floating point numbers, how this information is used by the BEAM compiler, and a scheme for efficient (just-in-time) compilation of floating point bytecode instructions to native code. The attractiveness of the scheme lies in its implementation simplicity. It has been fully incorporated in Erlang/OTP R9, and improves the performance of ERLANG programs manipulating floats considerably. We also show that by using this scheme, Erlang/OTP, despite being an implementation of a Dynamically Typed Language, achieves performance which is competitive with that of state-of-the-art implementations of strongly Typed strict functional Languages on floating point intensive programs.

  • unboxed compilation of floating point arithmetic in a Dynamically Typed Language environment
    Lecture Notes in Computer Science, 2003
    Co-Authors: Tobias Lindahl, Konstantinos Sagonas
    Abstract:

    In the context of the Dynamically Typed concurrent functional programming Language ERLANG, we describe a simple static analysis for identifying variables containing floating point numbers, how this information is used by the BEAM compiler, and a scheme for efficient (just-in-time) compilation of floating point bytecode instructions to native code. The attractiveness of the scheme lies in its implementation simplicity. It has been fully incorporated in Erlang/OTP R9, and improves the performance of ERLANG programs manipulating floats considerably. We also show that by using this scheme, Erlang/OTP, despite being an implementation of a Dynamically Typed Language, achieves performance which is competitive with that of state-of-the-art implementations of strongly Typed strict functional Languages on floating point intensive programs.