Proceedings Article10.1145/1942793.1942797
Konoha: implementing a static scripting language with dynamic behaviors
Kimio Kuramitsu
- 27 Sep 2010
- pp 21-29
11
TL;DR: The design of Konoha is presented, a statically typed object-oriented scripting language that is modeled to have the same or similar scripting experience with dynamic languages, by emulating major dynamic behaviors, such as duck typing and eval function.
read more
Abstract: This paper presents the design of Konoha, a statically typed object-oriented scripting language. Konoha is modeled to have the same or similar scripting experience with dynamic languages, by emulating major dynamic behaviors, such as duck typing and eval function. At the same time, its "run anytime" complier enables execution of incomplete programs without the compilation stop by the static type checker. Konoha was written in C from scratch, and is available as open-source software. We will show scripting experiences, as well as better performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages
TL;DR: This paper demonstrates that the use of Nez Extensions can realize many practical programming languages, such as C, C#, Ruby, and Python, which involve PEG-hard syntax.
8
•Posted Content
Nez: practical open grammar language
TL;DR: This work implements Nez with dynamic parsing, which allows users to integrate a Nez parser as a parser library that loads a grammar at runtime, and demonstrates that Nez dynamic parsers achieve very competitive performance compared to existing efficient parser generators.
8
Extensible online log analysis system
Midori Sugaya,Ken Igarashi,Masaaki Goshima,Shinpei Nakata,Kimio Kuramitsu +4 more
- 11 May 2011
TL;DR: An extensible online log analysis system that will reduce the debugging cost of the real-time system in the development phase and help the incremental development of complex systems that require adaptable improvements in either the developmental or operational phases is offered.
4
KonohaScript: static scripting for practical use
Kimio Kuramitsu
- 22 Oct 2011
TL;DR: This demonstration will show how KonohaScript improved scripting experiences with static typing, using the open source implementation fully written in C, and preserves useful programming supports by static typing.
3
•Posted Content
A declarative extension of parsing expression grammars for recognizing most programming languages
TL;DR: Nez as discussed by the authors is a declarative extension to PEGs, including symbol tables and conditional parsing, which can realize many practical programming languages such as C, C\#, Ruby, and Python, which involve PEG-hard syntax.
2
References
An empirical comparison of seven programming languages
TL;DR: The author comparatively analyzes 80 implementations of the phone-code program in seven different languages, investigating several aspects of each language, including program length, programming effort, runtime efficiency, memory consumption, and reliability.
Virtual machine showdown: Stack versus registers
TL;DR: This work presents a fully functional virtual-register implementation of the Java virtual machine (JVM), which supports Intel, AMD64, PowerPC and Alpha processors, and presents experimental results on a range of additional optimizations such as register allocation and elimination of redundant heap loads.
110
Thorn: robust, concurrent, extensible scripting on the JVM
Bard Bloom,John Field,Nathaniel Nystrom,Johan Östlund,Gregor Richards,Rok Strniša,Jan Vitek,Tobias Wrigstad +7 more
- 25 Oct 2009
TL;DR: The principal contributions are a careful selection of features that support the evolution of scripts into industrial grade programs - e.g., an expressive module system, an optional type annotation facility for declarations, and support for concurrency based on message passing between lightweight, isolated processes.
The Scala experiment: can we provide better language support for component systems?
Martin Odersky
- 11 Jan 2006
TL;DR: True component systems have been an elusive goal of the software industry, but large parts of software applications are written “from scratch”, so that software production is still more a craft than an industry.
30
Practical, pluggable types for a dynamic language
TL;DR: This work proposes a practical and pragmatic approach to introduce pluggable type systems to dynamic languages, and presents TypePlug, a Smalltalk implementation of the framework, and reports on experience applying the framework to three different pluggability type systems.
23
Related Papers (5)
Hugo Musso Gualandi,Roberto Ierusalimschy +1 more
- 20 Sep 2018
Roberto Ierusalimschy,Luiz Henrique de Figueiredo,Waldemar Celes +2 more
- 04 Nov 2015