https://github.com/singpolyma/permute-rankntypes

Permutation parsers using higher-kinded polymorphism
https://github.com/singpolyma/permute-rankntypes

Last synced: about 1 year ago
JSON representation

Permutation parsers using higher-kinded polymorphism

• Host: GitHub
• URL: https://github.com/singpolyma/permute-rankntypes
• Owner: singpolyma
• License: other
• Created: 2013-01-24T04:24:24.000Z (over 13 years ago)
• Default Branch: master
• Last Pushed: 2013-01-24T04:26:54.000Z (over 13 years ago)
• Last Synced: 2025-01-28T17:46:30.340Z (over 1 year ago)
• Language: Haskell
• Size: 109 KB
• Stars: 1
• Watchers: 5
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: LICENSE

Awesome Lists containing this project

README

          
This is a very small tweak to the excellent  library to change it from using ExistentialQuantification (which I at least find unappealing as a language extension) to using RankNTypes (which is something Haskell98 only lacks because of the implications for type inference).

The transformation is quite small and entirely mechanical.