CakeML/cakeml

better support for translating recursion through higher-order functions

Open

#9 opened on Dec 23, 2014

View on GitHub
 (1 comment) (0 reactions) (1 assignee)Standard ML (98 forks)auto 404
help wantedhigh effortmedium rewardtranslator

Repository metrics

Stars
 (1,169 stars)
PR merge metrics
 (PR metrics pending)

Description

The translator works on recursive functions that recurse as an argument to MAP (and maybe some other simple functions), but in general recursion as an argument to a higher-order function makes the translator fail when attempting to prove the certificate theorem using the induction theorem. A solution to the problem will probably require a more general form of certificate theorems (in particular, allowing arbitrary preconditions on arguments).

See this thread: https://lists.cakeml.org/private/dev/2014-December/000662.html

Contributor guide

Research direction
Examine the existing certificate theorem and induction theorem usage; investigate how to generalize certificate theorems to allow arbitrary preconditions on arguments for higher order recursive functions.
Tech stack
None
Domain
compilers
Issue type
Bug
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
None
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
30