An idea for a type system of multi-paradigm language with extensible syntax

Authors:
Valeri Bogdanov
Affiliations:
Technical University of Varna
Venue:
Proceedings of the 13th International Conference on Computer Systems and Technologies
Year:
2012

Citing 8
Cited 0

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Quasi-static typing

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic typing in a statically typed language

ACM Transactions on Programming Languages and Systems (TOPLAS)
The Ruby Way

The Ruby Way
Object-Oriented Multi-Methods in Cecil

ECOOP '92 Proceedings of the European Conference on Object-Oriented Programming
Teaching defensive programming in Java

Journal of Computing Sciences in Colleges
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Optimizing invokedynamic

Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article proposes a type system for a multi-paradigm language paradigm. A practical solution that provides the benefits of both static and dynamic typing is proposed, while using the features of the prototype - extensible declarative syntax. A checking algorithm is described that covers both explicit type hierarchy definitions and subtyping based on object's methods. Both compile time and runtime checking responsibilities are added to the type system allowing fluent integration between statically and dynamically checked code segments. Declarative definition of preconditions is provided.