Find open source projects actively accepting contributors. Search repositories, filter by program milestones, difficulty tags, or tech stack.
Use our Orbit AI Matcher to find out! Get instant matching scores based on your developer skills, preferred frameworks, and contribution experience.
Convert your selected open-source project into a winning GSoC, LFX, or Outreachy application using Proposal Studio.
<p>This proposal aims to add call hierarchy support in Haskell Language Server(HLS).</p> <p>Language Server Protocol(LSP) has <a href="https://microsoft.github.io/language-server-protocol/specifications/specification-current/#textDocument_prepareCallHierarchy" target="_blank">supported</a> call hierarchy in 3.16, which make us implement it in HLS possible.</p> <p>Inspired by <a href="https://github.com/haskell/haskell-language-server/issues/738" target="_blank">this issue</a>, my proposal involves the following steps this summer to contribute to call hierarchy:</p> <ol> <li><a href="https://github.com/haskell/lsp" target="_blank">LSP</a> spec support.</li> <li><code>prepareCallhierarchy</code> implementation.</li> <li><code>incomingCalls</code> implementation.</li> <li><code>outgoingCalls</code> implementation.</li> <li>Test</li> </ol> <p>I hope I can contribute to HLS to go further this summer.</p>
<p>This proposal aims to implement efficiently the quadratic sieve and the general number field sieve in Haskell while producing a mathematically rigorous description of the algorithms.</p>
<p>Currently, the package candidates are not using the templating system and their UI can be improved. To improve the candidates publishing process, we need to add certain functionality to smooth the process. The final goal is to implement a fixed workflow for package candidates and have the docbuilder and docuploads worked with them.</p>
The proposed project aims at establishing a port between GHC and [MMTk](https://www.mmtk.io/) -- an external memory management toolkit that provides languages with a set of memory management primitives and garbage collectors. The current existing GHC storage manager (GHCSM) has a sophisticated generational GC; However, it's also optimized and integrated into GHC's runtime, making it difficult to switch to a broader range of collectors. It would be beneficial to generalize GHC's runtime, make it separable from GHCSM, and connect it with a suite of different garbage collections from MMTk. To achieve this goal, we propose to: 1. Refactor GHC's runtime system to more effectively abstract over storage management operations; 2. Introduce a storage management backend using MMTk's trivial no-GC collection plan; 3. Integrate write barriers necessary for generational collection with MMTk; 4. Introduce support for MMTk's semi-space and mark-sweep GC plans.
<p>TidalCycles is an Embedded Domain Specific Language for pattern, in use by 10,000s of musicians worldwide. However it has had little work done on the user interface side; text editor plugins exist for vscode, atom, vim and emacs, but they are all simple wrappers around the ghci REPL. As a result Tidal is difficult to install, with many dependencies (ghc, cabal,libraries, build tools, and the supercollider digital signal processing system and its plugins) which developers may be comfortable with installing, but end-user ‘live coders’ are often turned away by. My idea is to develop the proof-of-concept for a Tidal API and editor plugin that allows new interactions with Tidal, and opens it up to a broader userbase.</p>
The project aimed to build a playground for Modern Fortran which enables users to run their code online. It will be offered as an extension to the official fortran-lang website where users can experiment with their code and play around with supported libraries. The playground also offers an interactive tutorial for Fortran newcomers, giving them an overview of the language syntax and features.
This proposal aims to enhance Liquid Haskell’s name resolution mechanism by enabling qualified imports for both (logic) type and predicate aliases. Currently, ambiguities arise when identical aliases are exported from multiple modules, adversely affecting both user experience and internal processing. The proposed solution will modify the internal alias representation and update all relevant use sites to construct fully qualified names, thereby allowing users to disambiguate identical aliases. Additionally, the project will conduct a detailed study of predicate alias use cases to evaluate the potential deprecation of these aliases in favor of the overlapping functionality provided by inline annotations. The primary deliverables include merged pull requests implementing qualified import support for type and predicate aliases, comprehensive documentation, and a blog post detailing design decisions, implementation processes, and the outcomes of the predicate alias study.
This proposal aims to describe how to add inlay hints support to the Haskell language server. Inlay hints can provide a more fancy, intuitive, and convenient ui view of the current state of the code, such as the fixity of operators, the type of bound symbols in `let`, the type of holes, etc. Some basic work already exists in the current HLS that makes it feasible to implement inlay hints, such as the basic type library already in use: https://github.com/haskell/lsp; and the hls plugin system. Prior to submitting this proposal, I had already started working on trying to make some implementation work, and had made some progress. I submitted a draft pull request (https://github.com/haskell/haskell-language-server/pull/4131) to hls's github repository, which lists some todo's, but it should be noted that there is more to this proposal than just the pr's, and any suitable information that can be presented with the help of inlay hints will be included in the work. Since the ability to configure inlay hints is already in the todo, even if inlay hints that are too informative are implemented, they will not be a bother to the user: the user has the ability to configure the information that inlay hints will display. In the body of the proposal, I detailed the timeline and details for implementing the idea. I'll continue to build on the progress of this pull request, gradually implementing more inlay hints usages and important configuration capabilities.
<p>Visual Debugging tools that will allow various ages to interact with and learn visually while tracing their bugs in Haskell</p>
<p>Figures play a central role in the life cycle of all kinds of research and analysis. That is: The communication of results.</p> <p>What we propose in this project is to extend <code>pandoc</code>’s figure handling capabilities to represent composite figures. This will provide a concise way to construct them compared with the alternative of writing LaTex code; and thus, facilitate source publishing.</p>
<p>The Haskell Language Server is a popular, comprehensive Haskell IDE; however, it is yet to implement a core feature: symbol renaming. With the recent addition of HieDB (a database for references in Haskell code), there is sufficient infrastructure to implement this feature.</p> <h3>Problem Benefits</h3> <p>Having an accessible renaming feature could encourage improving names, leading to clearer naming across the Haskell community. Renaming is especially useful in Haskell since short names are common, meaning they are often reused and difficult to disambiguate when renaming manually.</p> <h3>Project Aims</h3> <pre><code> - To support workspace-wide renaming of all names, including type synonyms, data constructors, and functions. - To support renaming of qualified imports. </code></pre>
<p>This is a proposal to add serialization and deserialization support for TOML in the functional configuration language Dhall. TOML is a relatively new configuration language that is easily human readable, supports dates and times, and is unambiguous. The biggest users of TOML are Rust’s Cargo, and consequently many Rust programs read TOML. Adding support for TOML in Dhall would mean users do not have to choose between readability and the power to program their configurations.</p>
This project aims to enhance OpenMP support in LFortran by developing a unified ASR node, that encapsulates all core and advanced OpenMP directives and clauses. The new design will enable robust handling of constructs like Parallel, Do, Teams, Tasks, Distribute, and Target offloading, ensuring systematic lowering to runtime calls. Key deliverables includes modifying the current design of representing OpenMp directives in ASR and implementing it's features via runtime calls and explore Target Offloading support. This will make LFortran a more powerful and extensible tool for HPC applications.
<p>Automatic Differentation (AD) is a technique for computing derivatives of numerical functions that does not use symbolic differentiation or finite-difference approximation. AD is used in a wide variety of fields, such as machine learning, optimization, quantitative finance, and physics, and the productivity boost generated by parallel AD has played a large role in recent advances in deep learning.</p> <p>The goal of this project is to implement parallel AD in Haskell using the \verb|accelerate| library. If successful, the project will provide an asymptotic speedup over current implementations for many functions of practical interest, stress-test a key foundation of the Haskell numerical infrastructure, and provide a greatly improved key piece of infrastructure for three of the remaining areas where Haskell's ecosystem is immature.</p>
<p>This project attempts to improve the native code generator of GHC by adding support for Intel AVX and SSE SIMD instructions. This support would enable GHC to expose a bunch of vector primitive operations, which can be utilized to by various high performance and scientific computing libraries of the Haskell ecosystem to parallelize their code for free.</p>
The idea is to Port the Entire site from Jekyll to Sphinx and MyST parser to add internationalisation as it comes built in Sphinx which also acts as an added advantage in implementing the site using sphinx and to increase the ease of maintenance and to make it easier for future contributors to contribute to the organisation.My Solution proposes the following Implementations: 1.Implement Interactive Community page using Js 2.Use Markdown for generating the static site in Sphinx + Myst 3.Internationalization Using Sphinx 4.Ease of Portability of Learn section of Fortan-lang.org site 5.Implement a new Sphinx extension to Create Docutil nodes in python. 6.Automate The Build of translated site using GitHub pages and Add Documentation to the New Fortran-lang.org site. 7.Addition of Extensive Documentation in Markdown files to the new Sphinx site and to make it easy for the new members to contribute to the community. 8.Implement changes and enhancements in UI/UX. 9.Implementation of landing page of site and Various pages and Layouts of the Site from Jekyll to Sphinx Using Markdown (Myst Dialect).
<p>Impement a WebSocket layer to hs-web3 and use this WebSocket Functionality to upgrade the current web3 modules and implement an IPFS-Api module using existing IPFS API services.</p>
<p>While much of the functionality required to use the <code>new-*</code> commands has already been implemented, there are not-insignificant parts of the design that was created last year that remain unrealized.</p> <p>By completing more of this design, I plan to help the <code>new-</code> prefix go away and to allow this safer, cleaner system to replace old-style cabal usage fully by rounding off the unfinished edges of the current proposal.</p>
<p>The project is about adding some new features to Alga library. This project is on the list of ideas.</p> <p>Briefly about goals:</p> <h4>Acyclic graphs</h4> <p>I finished up with this draft of definition for algebraic acyclic graphs:</p> <pre><code class="lang-Haskell">data AcyclicGraph a = Empty | Vertex a | Overlay (AcyclicGraph a) (AcyclicGraph a) | Connect [a] (AcyclicGraph a) | Shift (AcyclicGraph a) deriving (Eq, Show) </code></pre> <p>Here, the vertices of graph are splitted into "levels" and equal vertices from different levels are considered different. In my proposal, I show how one can deal with such definition and do some basic dynamic programming. I also made up instances for basic data classes, from Functor to MonadPlus.</p> <h4>Algorithms for edge-labelled graphs</h4> <p>Nothing special about that, I discussed common graph algortihms for weigted graphs, choosed which of them should be implemented and even drafted implementations of some of them.</p> <h4>Advanced graph algorithms</h4> <p>I started with discussion of algorithms for network flows and continued with special algorithms for bipartite graphs. Many of them are easily derived from other algorihtms' implementations.</p>
<p>A graph represents a <em>key structure</em> in computer science and they are known to be difficult to work with in functional programming languages. Several libraries are being implemented to create and process graphs in Haskell, each of them using different graph representation: Data.Graph from <a href="https://hackage.haskell.org/package/containers" target="_blank">containers</a>, <a href="https://hackage.haskell.org/package/fgl" target="_blank">fgl</a>, <a href="https://github.com/patrickdoc/hash-graph" target="_blank">hash-graph</a> and <a href="http://hackage.haskell.org/package/algebraic-graphs" target="_blank">alga</a>. Due to their differences and the lack of a common benchmark, it is not easy for a new user to select the one that will best fit their project. The new approach of alga seems particularly interesting since the way it deals with graphs is based on tangible mathematical results. Still, it is not very user friendly and it lacks some important features like widely-used algorithms or edge labels.</p> <p>Therefore, I propose to develop a benchmarking suite that will establish a reference benchmark for these libraries, as well as to enhance alga’s capabilities.</p>
<p>A collection of small to medium length tasks which will improve the Haskell editor tooling experience, as a continuation of my work on GSOC18 and HSOC17.</p>
<p>In recent years, several works (Weirich et al., 2017; Eisenberg, 2016; Gundry, 2013) have proposed to integrate dependent types into Haskell. However, compatibility with existing GHC features makes adding full-fledged dependent types into GHC very difficult. Fortunately, GHC has many phases underneath so it is possible to change one intermediate language without affecting the user experience, as steps towards dependent Haskell. The goal of this proposal is the replacement of GHC’s core language with a dependently-typed variant.</p>
<p>Hasktorch has two distinct APIs for tensors: Torch.Tensor and Torch.Tensor.Typed. While the untyped version can initially be easier to use and experiment with, the typed version offers static analysis of tensor’s shape, layout, precision, and compute device. The typed version not only helps with debugging and maintainability but also offers better support for type-driven development via GHC features like type holes. However, it is currently difficult to mix the two approaches, e.g., statically specifying tensor’s embedding size while keeping other dimensions unchecked is not possible. Gradual typing is the proposed solution that fuses the two APIs by adding Torch.GraduallyTyped type. The new API allows for more granular control by letting the user choose which properties of the tensor should be given a static type. The goal of the project is to bring maturity to the gradually typed tensor API, add missing features, and experiment with new ideas.</p>
<p>Issue-wanted is a web application focused on improving the open source Haskell community. It does so by centralizing and categorizing GitHub issues across many Haskell repositories into a single location. The current issue-wanted code base is a skeleton project with a list of desired features. Over the three month period, I will build the backend by implementing the GitHub API query functions, database schema, asynchronous worker, API endpoints, and the necessary tests. Many more decisions will be made throughout the process. This proposal covers the features and components that make up issue-wanted, and the different ways they may be implemented.</p>