Lambda Calculus with Regular Types

• Type: Article in International Conference Proceedings Book
• Date: 2016

Authors

Dundua, B (Author) Other; Florido, M (Author) FCUP; Kutsia, T (Author) Other

Conference proceedings International

Title: 2015 17TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC)

Pages: 129-136

17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

Timisoara, ROMANIA, SEP 21-24, 2015

Indexing

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Other information

Authenticus ID: P-00K-EDV

DOI: 10.1109/synasc.2015.29

Abstract (EN): In this paper we introduce lambda(R) : a foundational calculus for sequence processing with regular expression types. Its term language is the lambda calculus extended with sequences of terms and its types are regular expressions over simple types. We provide a flexible notion of subtyping based on the semantic notion of nominal interpretation of a type. Then we prove that types are preserved by reduction (subject reduction), and that there exist no infinite reduction sequences starting at typed terms (strong normalization).

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 8