https://github.com/dandandan/typeconstrainedprogramsearch

Type Constrained Program Search: Superoptimization using types and pruning
https://github.com/dandandan/typeconstrainedprogramsearch

Last synced: 24 days ago
JSON representation

Type Constrained Program Search: Superoptimization using types and pruning

• Host: GitHub
• URL: https://github.com/dandandan/typeconstrainedprogramsearch
• Owner: Dandandan
• License: mit
• Created: 2016-10-14T06:51:17.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2016-10-21T21:53:10.000Z (about 8 years ago)
• Last Synced: 2024-11-06T02:42:55.957Z (2 months ago)
• Language: Haskell
• Homepage:
• Size: 35.2 KB
• Stars: 2
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Type Constrained Program Search

Type Constrained Program Search: Super optimizing program search for type correct programs with equivalence pruning.

Examples

=== 

```haskell

-- Create goals: the program(s) should produce all input / output pairs

-- We want to find a program that computes f(x) = x^3 + 1

pow3PlusOneGoals = [([Int32Val 2], [Int32Val 9]), ([Int32Val 3], [Int32Val 28]), ([Int32Val 4], [Int32Val 65])]

-- Find a program that satisfies our constraints

-- This results in this (correct) program:  [Lds (-1),Lds (-1),Int32Mul,Int32Mul,Int32Inc]

pow3PlusOneProgram = head $ search defaultInstructionSet pow3PlusOneGoals pruned5Table

-- Goals for adding two popCounts: f(x, y) = popCount(x) + popCount(y)

popCounts2Goals = [([Int32Val x, Int32Val y], [Int32Val (fromIntegral $ popCount x + popCount y)]) | x <- [-100..100], y <- [-100..100]]

-- Finds as first result: [Int32PopCount,Lds (-2),Int32PopCount,Int32Add,Sts (-2)]

popCounts2Program = head $ search defaultInstructionSet popCounts2Goals pruned5Table

-- Find sorting program

-- Result: [Lds (-2),Lds (-3),Lds (-3),Int32Max,Sts (-4),Int32Min]

sort2Goals = [([Int32Val i, Int32Val j], sort [Int32Val i, Int32Val j]) | i <- [-10..10], j <- [-10..10]]

sort2Program = head $ search defaultInstructionSet sort2Goals pruned5Table

```