Interactive programming in Agda – Objects and graphical user interfaces
From MaRDI portal
Publication:5372002
DOI10.1017/S0956796816000319zbMath1418.68031OpenAlexW2552040597MaRDI QIDQ5372002
Andreas Abel, Anton Setzer, Stephan Adelsberger
Publication date: 23 October 2017
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796816000319
Functional programming and lambda calculus (68N18) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming with algebraic effects and handlers
- Notions of computation and monads
- Codatatypes in ML
- Inductive families
- Induction-recursion and initial algebras.
- Tarski's fixed-point theorem and lambda calculi with monotone inductive types
- Programming interfaces and basic topology
- A predicative analysis of structural recursion
- Copatterns
- Safe functional reactive programming through dependent types
- Foundational extensible corecursion: a proof assistant perspective
- How to Reason Coinductively Informally
- Mixed Inductive/Coinductive Types and Strong Normalization
- Type-Based Termination with Sized Products
- Inductive-Inductive Definitions
- Typestate: A programming language concept for enhancing software reliability
- Type-based termination of recursive definitions
- The view from the left
- A set constructor for inductive sets in Martin-Löf's type theory
- Wellfounded recursion with copatterns
- Coalgebras as Types Determined by Their Elimination Rules
- Type-Based Productivity of Stream Definitions in the Calculus of Constructions
- Small Induction Recursion
- Indexed containers
- Typed Lambda Calculi and Applications
- Semi-continuous Sized Types and Termination
- Rewriting Techniques and Applications
