refinement subset?

29 views

Skip to first unread message

Raoul Duke

unread,

Jun 19, 2019, 8:14:51 PM6/19/19

to ats-lang-users

might ATS support a set of dependent types that are known to be “quickly” & automatically solvable + marked as such?

gmhwxi

unread,

Jun 19, 2019, 9:56:57 PM6/19/19

to ats-lang-users

Not sure what you have in mind. For what purpose?

Raoul Duke

unread,

Jun 20, 2019, 1:32:12 AM6/20/19

to ats-lan...@googlegroups.com

my newbie impression is that refinement types are more automatic than fully dependent types. being able to use a subset of dependent types that are less onerous to prove could be a nice option.

Richard

unread,

Jun 20, 2019, 7:15:07 AM6/20/19

to ats-lang-users

Hey Raoul,

Do you have a particular example in mind?

Reply all

Reply to author

Forward

0 new messages