Elementary Standard ML

2018 ◽  
Author(s):  
G Michaelson
Keyword(s):  
1993 ◽  
Author(s):  
Edoardo Biagioni ◽  
Robert Harper ◽  
Peter Lee
Keyword(s):  

1994 ◽  
Author(s):  
Robert Harper ◽  
Frank Pfenning ◽  
Peter Lee ◽  
Eugene Rollins
Keyword(s):  

1990 ◽  
Vol 3 (4) ◽  
pp. 381-409 ◽  
Author(s):  
R. Ghosh-Roy
Keyword(s):  

2021 ◽  
Vol 31 ◽  
Author(s):  
BHARGAV SHIVKUMAR ◽  
JEFFREY MURPHY ◽  
LUKASZ ZIAREK

Abstract There is a growing interest in leveraging functional programming languages in real-time and embedded contexts. Functional languages are appealing as many are strictly typed, amenable to formal methods, have limited mutation, and have simple but powerful concurrency control mechanisms. Although there have been many recent proposals for specialized domain-specific languages for embedded and real-time systems, there has been relatively little progress on adapting more general purpose functional languages for programming embedded and real-time systems. In this paper, we present our current work on leveraging Standard ML (SML) in the embedded and real-time domains. Specifically, we detail our experiences in modifying MLton, a whole-program optimizing compiler for SML, for use in such contexts. We focus primarily on the language runtime, reworking the threading subsystem, object model, and garbage collector. We provide preliminary results over a radar-based aircraft collision detector ported to SML.


10.29007/svwc ◽  
2018 ◽  
Author(s):  
Satoshi Matsuoka
Keyword(s):  

We give a new proof of P-time completeness ofthe Linear Lambda Calculus, which was originally given by H. Mairson in 2003.Our proof uses an essentially different Boolean type from the type that Mairson used.Moreover the correctness of our proof can be machined-checked using an implementation of Standard ML.


Sign in / Sign up

Export Citation Format

Share Document