Lambda Calculus with Regular Types

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2016

Autores

Dundua, B (Autor) Outra; Florido, M (Autor) FCUP; Kutsia, T (Autor) Outra

Ata de Conferência Internacional

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

Páginas: 129-136

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

Timisoara, ROMANIA, SEP 21-24, 2015

Indexação

ISI Web of Knowledge - 0 Citações

Scopus - 0 Citações

Outras Informações

ID Authenticus: 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).

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 8