Fixed-Point-Oriented Programming: A Concise and Elegant Paradigm
Yong Qi Foo, Brian Sze-Kai Cheong, Michael D. Adams

TL;DR
Fixed-Point-Oriented Programming (FPOP) introduces a high-level, declarative paradigm that simplifies the implementation of fixed-point problems like graph algorithms, improving efficiency and maintainability.
Contribution
This paper presents FPOP as a novel programming paradigm that enables concise, expressive, and efficient implementations of fixed-point computations, bridging theory and practice.
Findings
FPOP simplifies complex algorithms, reducing code size significantly.
FPOP enhances maintainability and rapid prototyping.
FPOP demonstrates improved efficiency over traditional paradigms.
Abstract
Fixed-Point-Oriented Programming (FPOP) is an emerging paradigm designed to streamline the implementation of problems involving self-referential computations. These include graph algorithms, static analysis, parsing, and distributed computing-domains that traditionally require complex and tricky-to-implement work-queue algorithms. Existing programming paradigms lack direct support for these inherently fixed-point computations, leading to inefficient and error-prone implementations. This white paper explores the potential of the FPOP paradigm, which offers a high-level abstraction that enables concise and expressive problem formulations. By leveraging structured inference rules and user-directed optimizations, FPOP allows developers to write declarative specifications while the compiler ensures efficient execution. It not only reduces implementation complexity for programmers but also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
