Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms (Q4988930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms |
scientific article; zbMATH DE number 7350038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deriving efficient sequential and parallel generators for closed simply-typed lambda terms and normal forms |
scientific article; zbMATH DE number 7350038 |
Statements
Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (English)
0 references
20 May 2021
0 references
logic programming transformations
0 references
type inference
0 references
simply-typed lambda terms
0 references
normal forms
0 references
sequential combinatorial generation algorithms
0 references
parallel combinatorial generation algorithms
0 references
Prolog multi-threading
0 references
0 references
0.9206348657608032
0 references
0.8434442281723022
0 references
0.7786304950714111
0 references
0.7660769820213318
0 references
0.7555312514305115
0 references
