Publishing type：Research paper (scientific journal)  

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：Association for Computing Machinery (ACM)  

DOI： 10.1145/3236776

researchmap

Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.35.3_79

researchmap

researchmap

researchmap

researchmap

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：ACM Press  

DOI： 10.1145/2951913.2951944

Web of Science

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Springer Tokyo  

This paper proposes a new approach to embedding shell scripts in an ML-style typed functional language. Instead of representing each construct in the shell script language as a typed component, the proposed approach treats an untyped shell script program as a typed function. The programmer writes a shell script and specifies its type according to the intention of his/her script. The ML compiler automatically generates glue codes that serialize and de-serialize input and output data. With this embedding mechanism, an ML programmer can enjoy the full benefits of shell programming directly within an ML program. The proposed approach has been implemented in our SML# compiler.

DOI： 10.1007/s00354-016-0303-1

Web of Science

Scopus

researchmap

Other Link： http://link.springer.com/article/10.1007/s00354-016-0303-1/fulltext.html

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing  

This paper investigates language constructs for high-level and type-safe manipulation of JSON objects in a typed functional language. A major obstacle in representing JSON in a static type system is their heterogeneous nature: in most practical JSON APIs, a JSON array is a heterogeneous list consisting of, for example, objects having common fields and possibly some optional fields. This paper presents a typed calculus that reconciles static typing constraints and heterogeneous JSON arrays based on the idea of partially dynamic records originally proposed and sketched by Buneman and Ohori for complex database object manipulation. Partially dynamic records are dynamically typed records, but some parts of their structures are statically known. This feature enables us to represent JSON objects as typed data structures. The proposed calculus smoothly extends with ML-style pattern matching and record polymorphism. These results yield a typed functional language where the programmer can directly import JSON data as terms having static types, and can manipulate them with the full benefits of static polymorphic type-checking. The proposed calculus has been embodied in SML#, an extension of Standard ML with record polymorphism and other practically useful features. This paper also reports on the details of the implementation and demonstrates its feasibility through examples using actual Web APIs. The SML# version 3.1.0 compiler includes JSON support presented in this paper and is available from Tohoku University as open-source software under a BSD-style license.

DOI： 10.4230/LIPIcs.ECOOP.2016.18

Scopus

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Information Processing Society of Japan  

DOI： 10.2197/ipsjjip.24.141

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：日本ソフトウェア科学会  

Code reading is important in several situations, including reusing existing programs and developing a program by several persons. In this paper, we report on our prototype implementation of a code-reading assistance tool for a functional programming language. Our tool is based on an observation that name, such as variable names, is the basic ingredient of the data-flow, which represents computations in functional programs. Our tool provides the following two functionalities by using dependencies between names calculated by a compiler: it can find definitions of names from their uses, and vice versa; it can visualize dependencies of source files based on dependencies of variables and functions in them and thereby helps us intuitively understand resources that each module uses.

DOI： 10.11309/jssst.32.1_194

CiNii Article

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：Springer International Publishing  

DOI： 10.1007/978-3-319-12736-1_5

researchmap

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Association for Computing Machinery  

This paper reports on our industry-academia project of using a functional language in business software production. The general motivation behind the project is our ultimate goal of adopting an ML-style higher-order typed functional language in a wide range of ordinary software development in industry. To probe the feasibility and identify various practical problems and needs, we have conducted a 15 month pilot project for developing an enterprise resource planning (ERP) system in SML#. The project has successfully completed as we have planned, demonstrating the feasibility of SML#. In particular, seamless integration of SQL and direct C language interface are shown to be useful in reliable and efficient development of a data intensive business application. During the program development, we have found several useful functional programming patterns and a number of possible extensions of an ML-style language with records. This paper reports on the project details and the lessons learned from the project. © 2014 ACM.

DOI： 10.1145/2628136.2628164

Web of Science

Scopus

researchmap

researchmap

researchmap

researchmap

Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.29.1_191

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：ACM Press  

Motivated by developing a memory management system that allows functional languages to seamlessly inter-operate with C, we propose an efficient non-moving garbage collection algorithm based on bitmap marking and report its implementation and performance evaluation. In our method, the heap consists of sub-heaps {Hi | c ≤ i ≤ B} of exponentially increasing allocation sizes (Hi for 2i bytes) and a special sub-heap for exceptionally large objects. Actual space for each sub-heap is dynamically allocated and reclaimed from a pool of fixed size allocation segments. In each allocation segment, the algorithm maintains a bitmap representing the set of live objects. Allocation is done by searching for the next free bit in the bitmap. By adding meta-level bitmaps that summarize the contents of bitmaps hierarchically and maintaining the current bit position in the bitmap hierarchy, the next free bit can be found in a small constant time for most cases, and in log32(segmentSize) time in the worst case on a 32-bit architecture. The collection is done by clearing the bitmaps and tracing live objects. The algorithm can be extended to generational GC by maintaining multiple bitmaps for the same heap space. The proposed method does not require compaction and objects are not moved at all. This property is significant for a functional language to inter-operate with C, and it should also be beneficial in supporting multiple native threads. The proposed method has been implemented in a full-scale Standard ML compiler. Our benchmark tests show that our nonmoving collector performs as efficiently as a generational copying collector designed for functional languages. Copyright © 2011 ACM.

DOI： 10.1145/2034574.2034802

Web of Science

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：ACM Press  

Integrating a database query language into a programming language is becoming increasingly important in recently emerging high-level cloud computing and other applications, where efficient and sophisticated data manipulation is required during computation. This paper reports on seamless integration of SQL into SML# - an extension of Standard ML. In the integrated language, the type system always infers a principal type for any type consistent SQL expression. This makes SQL queries first-class citizens, which can be freely combined with any other language constructs definable in Standard ML. For a program involving SQL queries, the compiler separates SQL queries and delegates their evaluation to a database server, e.g. PostgreSQL or MySQL in the currently implemented version. The type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. In order to develop a practical language, however, a number of technical challenges have to be overcome, including static enforcement of server connection consistency, proper treatment of overloaded SQL primitives, query compilation, and runtime connection management. This paper describes the necessary extensions to the type system and compilation, and reports on the details of its implementation. Copyright © 2011 ACM.

DOI： 10.1145/2034574.2034815

Web of Science

Scopus

researchmap

researchmap

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.27.2_142

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.25.2_101

researchmap

Award type：Award from Japanese society, conference, symposium, etc.  Country：Japan

researchmap