Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…In general, SMT considers this structure of the programs, whereas components in (CL)S contain domain-specific details. Combinatory logic with intersection types is a Turing complete formalism that allows to define semantic taxonomies based on subtyping [9].…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…In general, SMT considers this structure of the programs, whereas components in (CL)S contain domain-specific details. Combinatory logic with intersection types is a Turing complete formalism that allows to define semantic taxonomies based on subtyping [9].…”
Section: Resultsmentioning
confidence: 99%
“…The underlying type system is well suited to express feature vectors of programs and software components. A user-specified repository Γ includes typed combinators that represent software components (c : σ) where c is the component name and σ is an intersection type [9,8].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…The implementation of (CL)S provides a framework for the automatic composition of software components from domain-specific repositories [5,10,16]. Automatic composition is performed by answering the type inhabitation problem of relativized Combinatory Logic with intersection types [14] Γ ?…”
Section: Synthesizing Robot Paths With Typesmentioning
confidence: 99%