Criteria for Bracket Abstractions Design | Zendy

Federico Flaviani | Zendy; Elias Tahhan Bitar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Criteria for Bracket Abstractions Design

Author(s) -

Federico Flaviani,

Elias Tahhan Bitar

Publication year - 2020

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2020.02.011

Subject(s) - combinatory logic , bracket , abstraction , property (philosophy) , computer science , scheme (mathematics) , operator (biology) , programming language , theoretical computer science , mathematics , algebra over a field , pure mathematics , mechanical engineering , mathematical analysis , philosophy , biochemistry , chemistry , epistemology , repressor , transcription factor , engineering , gene

A bracket abstraction is a syntactic operator to abstract variables in combinatory logic. There are different algorithms for different combinator systems. In this paper we present a recursive algorithm scheme, which generates a family of brackets abstractions, in which all the bracket abstractions referenced here are found. In addition, theorems with certain hypotheses are enunciated about the scheme, which state that the resulting abstraction operators, has one property or another. Thus forming a criteria for designing bracket abstractions that comply with a given property.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research