Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Ship Agents Faster
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
We extend the Eclipse IDE with tools for development in Haskell, a functional programming language, providing support for a wide range of tools (compilers, interpreters, doc tools etc.) in a coherent, convenient and configurable environment.
ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina
https://github.com/jplevyak/ifa
IFA, Iterative Flow Analysis is a combined data-flow and control flow analysis. It is capable of resolving the concrete types (as opposed to the nominal
or declared types) and the interprocedural call graph for statically or dynamically typed programs.
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
This is a collection of several simple functional languages all based on combinator graph reduction techniques for interpretation. For now there's only one package here: lazy-l, which is an interpreter for Alonzo Church's untyped lambda calculus.
This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net