A type system for hybrid intensional-imperative programming support in GIPSY

Mokhov, Serguei A.; Paquet, Joey; Tong, Xin

doi:10.1145/1557626.1557642

Cited by 9 publications

(24 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work complements our previous results describing the concrete GIPSY types specification and implementation in [1]. This work lays out primarily theoretical foundations behind the GIPSY Type System.…”

Section: Introductionsupporting

confidence: 65%

“…Using this platform, programs written in many flavors of Lucid can be compiled and executed in a variety of ways [1], [11], [20]. By being multilingual, GIPSY's design incorporates the flexible compilers framework and run-time system to allow processing of programs written in multiple dialects of Lucid as well as mixing them with common imperative languages, such as Java, potentially all in the same "program" or a source code file comprising a semantic unit of interrelated program fragments written in multiple languages and invoking each other.…”

Section: B Introduction To Gipsymentioning

confidence: 99%

“…The idea of the GIPSY's framework approach is to provide an infrastructure to develop compiler and run-time components for other languages of intensional nature easier as well as to execute them on a language-independent runtime system [1]. Additionally, Lucid, being a functional "data-flow" language, allows its programs to be naturally executed in a distributed processing environment because its constructs and expressions do not impose sequentiality.…”

Section: B Introduction To Gipsymentioning

confidence: 99%

“…types and operators) is extremely fine-grained and can hardly benefit from distributed evaluation of the operands. Adding granularity to the data elements manipulated by Lucid comes through the addition of coarser-grained data types and their corresponding operators [1]. With Lucid semantics being defined as typeless, a solution to the granularity problem consists in adding a hybrid counterpart to Lucid to allow an external language to define an algebra of coarser-grained types and operators [1].…”

Section: B Introduction To Gipsymentioning

confidence: 99%

See 3 more Smart Citations

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Mokhov¹,

Paquet

2010

2010 IEEE/ACIS 9th International Conference on Computer and Information Science

Self Cite

View full text Add to dashboard Cite

We present a type system theory for the General Intensional Programming System (GIPSY), a platform designed to support intensional programming languages (built upon higher-order intensional logic) and their imperative counter-parts for the eductive execution model. We extend the simple theory of types (STT) by adding the intensionality axiom to it. The intensionality principle covers language expressions that explicitly take into account a multidimensional context space of evaluation treating the context as a first-class value. We, therefore, describe and discuss the properties of such a type system and the related type theory. This work is done to complement our previous software engineering design and implementation study of the GIPSY type system.

show abstract

Section: Introductionsupporting

confidence: 65%

Section: B Introduction To Gipsymentioning

confidence: 99%

Section: B Introduction To Gipsymentioning

confidence: 99%

Section: B Introduction To Gipsymentioning

confidence: 99%

See 2 more Smart Citations

A Type System for Higher-Order Intensional Logic Support for Variable Bindings in Hybrid Intensional-Imperative Programs in GIPSY

Mokhov¹,

Paquet

2010

2010 IEEE/ACIS 9th International Conference on Computer and Information Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…IDemand is used for both demands and their results. When the result of computation reaches the top of the tree resolution, the final result of the program is computed -it is an instance of some subclass of the GIPSYType from the GIPSY Type System [69]. Thus, the high-level observation sequence is encoded as:…”

Section: Gipsymentioning

confidence: 99%

Self-Forensics Through Case Studies of Small-to-Medium Software Systems

Mokhov

Vassev

2009

2009 Fifth International Conference on IT Security Incident Management and IT Forensics

Self Cite

View full text Add to dashboard Cite

The notion and definition of self-forensics was introduced by Mokhov to encompass software and hardware capabilities for autonomic and other systems to record their own states, events, and others encoded in a forensic form suitable for (potentially automated) forensic analysis, evidence modeling and specification, and event reconstruction for various system components. For self-forensics, "self-dissection" is possible for analysis using a standard language and decision making if the system includes such a self-forensic subsystem. The self-forensic evidence is encoded in a cyberforensic investigation case and event reconstruction language, Forensic Lucid. The encoding of the stories depicted by the evidence comprise a context as a first-class value of a Forensic Lucid "program", after which an investigator models the case describing relationships between various events and pieces of information. It is important to get the context right for the case to have a meaning and the proper meaning computation, so we perform case studies of some small-to-medium, distributed and not, primarily academic open-source software systems. In this work, for the purpose of implementation of the small self-forensic modules for the data structures and event flow, we specify the requirements of what the context should be for those systems. The systems share in common the base programming language -Java, so our self-forensic logging of the Java data structures and events as Forensic Lucid context specification expressions is laid out ready for an investigator to examine and model the case.

show abstract