Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.
Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
Try Free
$300 Free Credits for Your Google Cloud Projects
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.
Proof Logic : A logical framework for theorem proving
Proof Logic is a functional and equational logical framework for theorem proving based on Combinatory Logic and LambdaCalculus, whose expressions are both terms and proofs proving the equality between two terms.
LIPS is an easy-to-use command line interpreter for the lambda-calculus. It supports different evaluation strategies, a trace-mode, abbreviations and typing. Furthermore LIPS allows to export interpreter-sessions to a user-definable format (e.g., LaTeX).
LPIA is an interpreted symbolic functional language with multi-process
capabilities and predefined pattern matching. It is inspired by combinatory
logic, lambdacalculus, Scheme and Forth.
LPIA est un langage symbolique fonctionnel interprété avec des possibilités multi-processus et un filtrage prédéfini. Il est inspiré par la logique combinatoire, le lambda calcul, Scheme et Forth.
LCI is an interpreter for the lambdacalculus. It supports many advances features like integers, recursion, user defined operators and multiple evaluation strategies.
Pagkalos is an interpreted language written in Java. It supports the lambda-calculus and object-oriented techniques. All statements are writeen in reversed polish notation. Java-classes, objects and methods are easily accessible with the dot-notation.
An interpreter of lambdacalculus.
It shows reduction process of lambda terms.
Several evaluation strategies are supported.
Output format can be selected from LaTex, plain text.
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 lambdacalculus.