The power of Pi
DOI10.1145/1411204.1411213zbMATH Open1323.68145OpenAlexW4237116508MaRDI QIDQ5178754FDOQ5178754
Authors: Nicolas Oury, Wouter Swierstra
Publication date: 16 March 2015
Published in: Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1411204.1411213
Recommendations
Theory of programming languages (68N15) Cryptography (94A60) Database theory (68P15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (10)
- Title not available (Why is that?)
- Auto in Agda. Programming proof search using reflection
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- \(\Pi\)-Ware: hardware description and verification in Agda
- More dependent types for distributed arrays
- The quest for pi
- Title not available (Why is that?)
- The legal values of pi
- \textsc{Mnemonics}: type-safe bytecode generation at run time
- Dependently typed programming in Agda
This page was built for publication: The power of Pi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178754)